./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 e19ca921 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-dev-e19ca92 [2021-12-22 00:04:19,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:04:19,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:04:19,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:04:19,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:04:19,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:04:19,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:04:19,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:04:19,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:04:19,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:04:19,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:04:19,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:04:19,918 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:04:19,919 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:04:19,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:04:19,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:04:19,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:04:19,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:04:19,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:04:19,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:04:19,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:04:19,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:04:19,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:04:19,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:04:19,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:04:19,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:04:19,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:04:19,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:04:19,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:04:19,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:04:19,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:04:19,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:04:19,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:04:19,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:04:19,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:04:19,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:04:19,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:04:19,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:04:19,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:04:19,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:04:19,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:04:19,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:04:19,979 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:04:19,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:04:19,980 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:04:19,980 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:04:19,981 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:04:19,981 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:04:19,981 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:04:19,982 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:04:19,982 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:04:19,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:04:19,983 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:04:19,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:04:19,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:04:19,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:04:19,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:04:19,984 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:04:19,984 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:04:19,984 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:04:19,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:04:19,984 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:04:19,985 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:04:19,985 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:04:19,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:04:19,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:04:19,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:04:19,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:04:19,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:04:19,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:04:19,986 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:04:19,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:04:19,987 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:04:19,987 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 [2021-12-22 00:04:20,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:04:20,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:04:20,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:04:20,205 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:04:20,205 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:04:20,206 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 [2021-12-22 00:04:20,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e5d0eaf/8ee241b03bd04d15bf816cdcab0a3c0e/FLAGfc910a2dc [2021-12-22 00:04:20,659 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:04:20,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-22 00:04:20,678 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e5d0eaf/8ee241b03bd04d15bf816cdcab0a3c0e/FLAGfc910a2dc [2021-12-22 00:04:20,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4e5d0eaf/8ee241b03bd04d15bf816cdcab0a3c0e [2021-12-22 00:04:20,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:04:20,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:04:20,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:04:20,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:04:20,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:04:20,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:04:20" (1/1) ... [2021-12-22 00:04:20,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46721b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:20, skipping insertion in model container [2021-12-22 00:04:20,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:04:20" (1/1) ... [2021-12-22 00:04:20,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:04:20,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:04:20,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:04:21,007 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:04:21,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:04:21,096 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:04:21,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21 WrapperNode [2021-12-22 00:04:21,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:04:21,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:04:21,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:04:21,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:04:21,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,171 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-22 00:04:21,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:04:21,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:04:21,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:04:21,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:04:21,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:04:21,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:04:21,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:04:21,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:04:21,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (1/1) ... [2021-12-22 00:04:21,224 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:04:21,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:21,252 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) [2021-12-22 00:04:21,263 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 [2021-12-22 00:04:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:04:21,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:04:21,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:04:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:04:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:04:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:04:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:04:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:04:21,377 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:04:21,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:04:21,869 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:04:21,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:04:21,876 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-22 00:04:21,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:04:21 BoogieIcfgContainer [2021-12-22 00:04:21,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:04:21,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:04:21,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:04:21,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:04:21,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:04:20" (1/3) ... [2021-12-22 00:04:21,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d711130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:04:21, skipping insertion in model container [2021-12-22 00:04:21,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:04:21" (2/3) ... [2021-12-22 00:04:21,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d711130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:04:21, skipping insertion in model container [2021-12-22 00:04:21,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:04:21" (3/3) ... [2021-12-22 00:04:21,886 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-22 00:04:21,895 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:04:21,895 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-22 00:04:21,930 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:04:21,936 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:04:21,936 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-22 00:04:21,948 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) [2021-12-22 00:04:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:04:21,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:21,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:04:21,953 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:21,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:04:21,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:21,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110993716] [2021-12-22 00:04:21,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:21,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:22,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:22,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:22,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110993716] [2021-12-22 00:04:22,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110993716] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:22,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:22,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:22,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838905883] [2021-12-22 00:04:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:22,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:22,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:22,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:22,148 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) [2021-12-22 00:04:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:22,404 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2021-12-22 00:04:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:22,406 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 [2021-12-22 00:04:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:22,426 INFO L225 Difference]: With dead ends: 282 [2021-12-22 00:04:22,426 INFO L226 Difference]: Without dead ends: 278 [2021-12-22 00:04:22,429 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:22,432 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:22,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-22 00:04:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2021-12-22 00:04:22,488 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) [2021-12-22 00:04:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2021-12-22 00:04:22,491 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2021-12-22 00:04:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:22,491 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2021-12-22 00:04:22,491 INFO L471 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) [2021-12-22 00:04:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2021-12-22 00:04:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:04:22,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:22,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:04:22,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:04:22,493 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:22,495 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:04:22,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:22,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915582281] [2021-12-22 00:04:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:22,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:22,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:22,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915582281] [2021-12-22 00:04:22,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915582281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:22,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:22,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:22,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066304496] [2021-12-22 00:04:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:22,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:22,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:22,564 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) [2021-12-22 00:04:22,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:22,706 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-22 00:04:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:22,706 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 [2021-12-22 00:04:22,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:22,707 INFO L225 Difference]: With dead ends: 197 [2021-12-22 00:04:22,708 INFO L226 Difference]: Without dead ends: 197 [2021-12-22 00:04:22,708 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:22,709 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:22,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:22,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-22 00:04:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-22 00:04:22,715 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) [2021-12-22 00:04:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-12-22 00:04:22,716 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2021-12-22 00:04:22,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:22,717 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-12-22 00:04:22,717 INFO L471 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) [2021-12-22 00:04:22,717 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-12-22 00:04:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-22 00:04:22,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:22,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-22 00:04:22,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:04:22,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:22,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:22,719 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-22 00:04:22,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:22,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767879984] [2021-12-22 00:04:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:22,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:22,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:22,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767879984] [2021-12-22 00:04:22,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767879984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:22,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:22,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:22,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040619354] [2021-12-22 00:04:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:22,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:04:22,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:22,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:04:22,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:04:22,829 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) [2021-12-22 00:04:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:23,151 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-12-22 00:04:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:04:23,152 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 [2021-12-22 00:04:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:23,153 INFO L225 Difference]: With dead ends: 354 [2021-12-22 00:04:23,153 INFO L226 Difference]: Without dead ends: 354 [2021-12-22 00:04:23,153 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:23,154 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:23,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:04:23,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-22 00:04:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2021-12-22 00:04:23,164 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) [2021-12-22 00:04:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-12-22 00:04:23,166 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2021-12-22 00:04:23,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:23,166 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-12-22 00:04:23,166 INFO L471 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) [2021-12-22 00:04:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-12-22 00:04:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:04:23,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:23,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:23,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:04:23,168 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:23,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-22 00:04:23,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:23,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800830986] [2021-12-22 00:04:23,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:23,170 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:23,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:23,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800830986] [2021-12-22 00:04:23,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800830986] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:23,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:23,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:23,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356436717] [2021-12-22 00:04:23,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:23,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:23,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:23,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:23,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:23,259 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) [2021-12-22 00:04:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:23,468 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2021-12-22 00:04:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:04:23,468 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 [2021-12-22 00:04:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:23,469 INFO L225 Difference]: With dead ends: 189 [2021-12-22 00:04:23,469 INFO L226 Difference]: Without dead ends: 189 [2021-12-22 00:04:23,470 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:23,471 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:23,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-22 00:04:23,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-22 00:04:23,480 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) [2021-12-22 00:04:23,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-12-22 00:04:23,481 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2021-12-22 00:04:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:23,482 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-12-22 00:04:23,482 INFO L471 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) [2021-12-22 00:04:23,483 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-12-22 00:04:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:04:23,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:23,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:23,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:04:23,484 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:23,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-22 00:04:23,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:23,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182293385] [2021-12-22 00:04:23,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:23,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:23,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:23,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182293385] [2021-12-22 00:04:23,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182293385] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:23,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:23,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:23,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110519550] [2021-12-22 00:04:23,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:23,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:23,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:23,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:23,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:23,578 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) [2021-12-22 00:04:23,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:23,785 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2021-12-22 00:04:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:04:23,785 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 [2021-12-22 00:04:23,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:23,786 INFO L225 Difference]: With dead ends: 188 [2021-12-22 00:04:23,787 INFO L226 Difference]: Without dead ends: 188 [2021-12-22 00:04:23,787 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:23,788 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:23,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:23,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-22 00:04:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-22 00:04:23,792 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) [2021-12-22 00:04:23,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2021-12-22 00:04:23,793 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2021-12-22 00:04:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:23,793 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2021-12-22 00:04:23,793 INFO L471 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) [2021-12-22 00:04:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2021-12-22 00:04:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 00:04:23,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:23,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:23,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:04:23,794 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2021-12-22 00:04:23,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031948906] [2021-12-22 00:04:23,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:23,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:23,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:23,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031948906] [2021-12-22 00:04:23,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031948906] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:23,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:23,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:04:23,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001810393] [2021-12-22 00:04:23,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:23,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:04:23,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:23,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:04:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:04:23,900 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) [2021-12-22 00:04:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:24,346 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2021-12-22 00:04:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:04:24,347 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 [2021-12-22 00:04:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:24,348 INFO L225 Difference]: With dead ends: 353 [2021-12-22 00:04:24,348 INFO L226 Difference]: Without dead ends: 353 [2021-12-22 00:04:24,348 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:24,349 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 470 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:24,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 675 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-22 00:04:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2021-12-22 00:04:24,357 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) [2021-12-22 00:04:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2021-12-22 00:04:24,358 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2021-12-22 00:04:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:24,359 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2021-12-22 00:04:24,359 INFO L471 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) [2021-12-22 00:04:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2021-12-22 00:04:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 00:04:24,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:24,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:24,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:04:24,360 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2021-12-22 00:04:24,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027416899] [2021-12-22 00:04:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:24,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:24,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:24,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027416899] [2021-12-22 00:04:24,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027416899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:24,506 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:24,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:04:24,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004343688] [2021-12-22 00:04:24,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:24,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:04:24,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:24,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:04:24,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:04:24,508 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) [2021-12-22 00:04:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:25,008 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2021-12-22 00:04:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:04:25,008 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 [2021-12-22 00:04:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:25,010 INFO L225 Difference]: With dead ends: 347 [2021-12-22 00:04:25,010 INFO L226 Difference]: Without dead ends: 347 [2021-12-22 00:04:25,010 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:25,011 INFO L933 BasicCegarLoop]: 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.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:25,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-22 00:04:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2021-12-22 00:04:25,016 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) [2021-12-22 00:04:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2021-12-22 00:04:25,016 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2021-12-22 00:04:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:25,017 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2021-12-22 00:04:25,017 INFO L471 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) [2021-12-22 00:04:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2021-12-22 00:04:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:04:25,018 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:25,018 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:25,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:04:25,018 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2021-12-22 00:04:25,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:25,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239337030] [2021-12-22 00:04:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:25,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:25,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:25,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239337030] [2021-12-22 00:04:25,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239337030] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:25,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:25,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:25,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916420922] [2021-12-22 00:04:25,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:25,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:25,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:25,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:25,050 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) [2021-12-22 00:04:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:25,230 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2021-12-22 00:04:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:25,230 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 [2021-12-22 00:04:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:25,232 INFO L225 Difference]: With dead ends: 316 [2021-12-22 00:04:25,232 INFO L226 Difference]: Without dead ends: 316 [2021-12-22 00:04:25,232 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:25,233 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:25,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-22 00:04:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2021-12-22 00:04:25,236 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) [2021-12-22 00:04:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-22 00:04:25,237 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2021-12-22 00:04:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:25,237 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-22 00:04:25,237 INFO L471 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) [2021-12-22 00:04:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-22 00:04:25,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:04:25,238 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:25,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:25,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:04:25,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2021-12-22 00:04:25,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277346337] [2021-12-22 00:04:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:25,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:25,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:25,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277346337] [2021-12-22 00:04:25,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277346337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:25,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:25,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:25,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33376701] [2021-12-22 00:04:25,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:25,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:25,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:25,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:25,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:25,274 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) [2021-12-22 00:04:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:25,411 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-22 00:04:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:25,412 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 [2021-12-22 00:04:25,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:25,413 INFO L225 Difference]: With dead ends: 293 [2021-12-22 00:04:25,413 INFO L226 Difference]: Without dead ends: 293 [2021-12-22 00:04:25,414 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:25,414 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:25,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-22 00:04:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2021-12-22 00:04:25,418 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) [2021-12-22 00:04:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2021-12-22 00:04:25,418 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2021-12-22 00:04:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:25,419 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2021-12-22 00:04:25,419 INFO L471 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) [2021-12-22 00:04:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2021-12-22 00:04:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 00:04:25,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:25,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:25,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:04:25,420 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2021-12-22 00:04:25,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522506624] [2021-12-22 00:04:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:25,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:25,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522506624] [2021-12-22 00:04:25,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522506624] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:25,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:25,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:25,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719773926] [2021-12-22 00:04:25,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:25,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:04:25,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:04:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:04:25,451 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) [2021-12-22 00:04:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:25,639 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2021-12-22 00:04:25,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:04:25,639 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 [2021-12-22 00:04:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:25,641 INFO L225 Difference]: With dead ends: 254 [2021-12-22 00:04:25,641 INFO L226 Difference]: Without dead ends: 254 [2021-12-22 00:04:25,641 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:25,641 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:25,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:25,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-22 00:04:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2021-12-22 00:04:25,645 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) [2021-12-22 00:04:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2021-12-22 00:04:25,646 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2021-12-22 00:04:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:25,647 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2021-12-22 00:04:25,647 INFO L471 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) [2021-12-22 00:04:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2021-12-22 00:04:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 00:04:25,647 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:25,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:25,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 00:04:25,648 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:25,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2021-12-22 00:04:25,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:25,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021659843] [2021-12-22 00:04:25,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:25,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:25,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:25,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021659843] [2021-12-22 00:04:25,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021659843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:25,707 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:25,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:25,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240600644] [2021-12-22 00:04:25,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:25,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:25,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:25,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:25,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:25,710 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) [2021-12-22 00:04:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:26,043 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2021-12-22 00:04:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:04:26,044 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 [2021-12-22 00:04:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:26,045 INFO L225 Difference]: With dead ends: 438 [2021-12-22 00:04:26,045 INFO L226 Difference]: Without dead ends: 438 [2021-12-22 00:04:26,046 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:26,046 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:26,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:04:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-22 00:04:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2021-12-22 00:04:26,054 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) [2021-12-22 00:04:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2021-12-22 00:04:26,055 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2021-12-22 00:04:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:26,055 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2021-12-22 00:04:26,055 INFO L471 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) [2021-12-22 00:04:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2021-12-22 00:04:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:04:26,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:26,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:26,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 00:04:26,057 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:26,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2021-12-22 00:04:26,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:26,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602308258] [2021-12-22 00:04:26,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:26,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:26,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602308258] [2021-12-22 00:04:26,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602308258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:26,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:26,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:04:26,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621769506] [2021-12-22 00:04:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:26,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:04:26,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:26,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:04:26,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:04:26,145 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) [2021-12-22 00:04:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:26,676 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2021-12-22 00:04:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:04:26,677 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 [2021-12-22 00:04:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:26,680 INFO L225 Difference]: With dead ends: 784 [2021-12-22 00:04:26,680 INFO L226 Difference]: Without dead ends: 784 [2021-12-22 00:04:26,680 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:26,681 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:26,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 00:04:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-12-22 00:04:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2021-12-22 00:04:26,688 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) [2021-12-22 00:04:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-12-22 00:04:26,689 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2021-12-22 00:04:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:26,690 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-12-22 00:04:26,690 INFO L471 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) [2021-12-22 00:04:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-12-22 00:04:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:04:26,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:26,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:26,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 00:04:26,691 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:26,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2021-12-22 00:04:26,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:26,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517308223] [2021-12-22 00:04:26,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:26,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:26,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:26,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517308223] [2021-12-22 00:04:26,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517308223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:26,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:26,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 00:04:26,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294300916] [2021-12-22 00:04:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:26,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:04:26,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:04:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:04:26,855 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) [2021-12-22 00:04:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:27,453 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2021-12-22 00:04:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:04:27,454 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 [2021-12-22 00:04:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:27,456 INFO L225 Difference]: With dead ends: 603 [2021-12-22 00:04:27,456 INFO L226 Difference]: Without dead ends: 603 [2021-12-22 00:04:27,456 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:27,456 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 392 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:27,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 926 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 00:04:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-22 00:04:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2021-12-22 00:04:27,463 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) [2021-12-22 00:04:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2021-12-22 00:04:27,464 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2021-12-22 00:04:27,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:27,464 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2021-12-22 00:04:27,464 INFO L471 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) [2021-12-22 00:04:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2021-12-22 00:04:27,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:04:27,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:27,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:27,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 00:04:27,466 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:27,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:27,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2021-12-22 00:04:27,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:27,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21725864] [2021-12-22 00:04:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:27,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:27,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21725864] [2021-12-22 00:04:27,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21725864] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:27,491 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:27,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:27,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608314999] [2021-12-22 00:04:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:27,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:27,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:27,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:27,492 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) [2021-12-22 00:04:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:27,509 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2021-12-22 00:04:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:27,509 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 [2021-12-22 00:04:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:27,511 INFO L225 Difference]: With dead ends: 395 [2021-12-22 00:04:27,511 INFO L226 Difference]: Without dead ends: 395 [2021-12-22 00:04:27,511 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:27,512 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:27,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:04:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-22 00:04:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2021-12-22 00:04:27,517 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) [2021-12-22 00:04:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2021-12-22 00:04:27,519 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2021-12-22 00:04:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:27,519 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2021-12-22 00:04:27,519 INFO L471 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) [2021-12-22 00:04:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2021-12-22 00:04:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 00:04:27,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:27,520 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:27,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 00:04:27,520 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:27,521 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2021-12-22 00:04:27,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:27,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705577491] [2021-12-22 00:04:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:27,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:27,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705577491] [2021-12-22 00:04:27,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705577491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:27,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:27,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:27,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641526432] [2021-12-22 00:04:27,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:27,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:27,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:27,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:27,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:27,547 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) [2021-12-22 00:04:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:27,555 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2021-12-22 00:04:27,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:27,556 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 [2021-12-22 00:04:27,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:27,557 INFO L225 Difference]: With dead ends: 365 [2021-12-22 00:04:27,557 INFO L226 Difference]: Without dead ends: 365 [2021-12-22 00:04:27,558 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:27,558 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:27,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:04:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-22 00:04:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-12-22 00:04:27,564 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) [2021-12-22 00:04:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-12-22 00:04:27,565 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2021-12-22 00:04:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:27,565 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-12-22 00:04:27,565 INFO L471 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) [2021-12-22 00:04:27,565 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-12-22 00:04:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 00:04:27,566 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:27,566 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:27,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 00:04:27,567 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:27,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:27,567 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2021-12-22 00:04:27,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:27,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860625926] [2021-12-22 00:04:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:27,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:27,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860625926] [2021-12-22 00:04:27,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860625926] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:04:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124730491] [2021-12-22 00:04:27,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:27,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:27,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:27,725 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) [2021-12-22 00:04:27,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 00:04:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:27,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 00:04:27,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:04:27,926 INFO L387 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 [2021-12-22 00:04:27,962 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:27,962 INFO L387 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 [2021-12-22 00:04:27,986 INFO L387 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 [2021-12-22 00:04:28,062 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:28,063 INFO L387 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 [2021-12-22 00:04:28,119 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-22 00:04:28,120 INFO L387 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 [2021-12-22 00:04:28,221 INFO L387 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 [2021-12-22 00:04:28,359 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:28,359 INFO L387 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 [2021-12-22 00:04:28,434 INFO L353 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-22 00:04:28,434 INFO L387 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 [2021-12-22 00:04:28,453 INFO L387 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 [2021-12-22 00:04:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:28,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:04:28,926 WARN L838 $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 [2021-12-22 00:04:29,103 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:04:29,103 INFO L387 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 [2021-12-22 00:04:29,107 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:04:29,110 INFO L387 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 [2021-12-22 00:04:29,165 INFO L353 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2021-12-22 00:04:29,166 INFO L387 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 [2021-12-22 00:04:29,247 INFO L387 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 [2021-12-22 00:04:29,259 INFO L387 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 [2021-12-22 00:04:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:31,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124730491] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:04:31,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:04:31,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2021-12-22 00:04:31,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519958835] [2021-12-22 00:04:31,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:04:31,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-22 00:04:31,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:31,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-22 00:04:31,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=526, Unknown=6, NotChecked=48, Total=702 [2021-12-22 00:04:31,016 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) [2021-12-22 00:04:31,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:31,358 INFO L93 Difference]: Finished difference Result 459 states and 657 transitions. [2021-12-22 00:04:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 00:04:31,359 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 [2021-12-22 00:04:31,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:31,361 INFO L225 Difference]: With dead ends: 459 [2021-12-22 00:04:31,361 INFO L226 Difference]: Without dead ends: 459 [2021-12-22 00:04:31,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=774, Unknown=6, NotChecked=60, Total=1056 [2021-12-22 00:04:31,362 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-22 00:04:31,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1361 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 488 Unchecked, 0.2s Time] [2021-12-22 00:04:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-22 00:04:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2021-12-22 00:04:31,367 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) [2021-12-22 00:04:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2021-12-22 00:04:31,368 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2021-12-22 00:04:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:31,369 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2021-12-22 00:04:31,369 INFO L471 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) [2021-12-22 00:04:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2021-12-22 00:04:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 00:04:31,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:31,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:31,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:04:31,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-22 00:04:31,595 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2021-12-22 00:04:31,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:31,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435074748] [2021-12-22 00:04:31,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:31,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:31,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435074748] [2021-12-22 00:04:31,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435074748] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:04:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275358379] [2021-12-22 00:04:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:31,993 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:31,994 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) [2021-12-22 00:04:31,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 00:04:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:32,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-22 00:04:32,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:04:32,109 INFO L387 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 [2021-12-22 00:04:32,141 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:32,142 INFO L387 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 [2021-12-22 00:04:32,187 INFO L387 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 [2021-12-22 00:04:32,190 INFO L387 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 [2021-12-22 00:04:32,261 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:32,261 INFO L387 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 [2021-12-22 00:04:32,265 INFO L387 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 [2021-12-22 00:04:32,293 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:32,294 INFO L387 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 [2021-12-22 00:04:32,392 INFO L387 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 [2021-12-22 00:04:32,396 INFO L387 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 [2021-12-22 00:04:32,480 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:32,480 INFO L387 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 [2021-12-22 00:04:32,486 INFO L387 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 [2021-12-22 00:04:32,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:32,525 INFO L387 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 [2021-12-22 00:04:32,531 INFO L353 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-22 00:04:32,532 INFO L387 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 [2021-12-22 00:04:32,563 INFO L387 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 [2021-12-22 00:04:32,566 INFO L387 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 [2021-12-22 00:04:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:32,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:04:33,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:04:33,037 INFO L387 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 [2021-12-22 00:04:33,042 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:04:33,043 INFO L387 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 [2021-12-22 00:04:33,141 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (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_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|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 0)) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse2 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| 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)) |c_ULTIMATE.start_main_#t~mem9#1.base|)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (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_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2021-12-22 00:04:33,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (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_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|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (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_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (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 [2021-12-22 00:04:33,570 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)) (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_4)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_558))) (= (select (select (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| 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 .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_562)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) 0))))) is different from false [2021-12-22 00:04:33,630 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:04:33,631 INFO L387 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 170 treesize of output 161 [2021-12-22 00:04:33,638 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:04:33,638 INFO L387 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 161 treesize of output 121 [2021-12-22 00:04:33,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:04:33,645 INFO L387 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 704 treesize of output 566 [2021-12-22 00:04:33,662 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:04:33,666 INFO L387 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 966 treesize of output 918 [2021-12-22 00:04:33,681 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:04:33,682 INFO L387 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 [2021-12-22 00:04:33,707 INFO L387 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 206 treesize of output 182 [2021-12-22 00:04:33,709 INFO L387 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 182 treesize of output 170 [2021-12-22 00:04:33,713 INFO L387 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 [2021-12-22 00:04:33,791 INFO L387 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 319 treesize of output 239 [2021-12-22 00:04:33,795 INFO L387 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 239 treesize of output 207 [2021-12-22 00:04:34,034 INFO L387 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 [2021-12-22 00:04:34,040 INFO L387 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 138 treesize of output 114 [2021-12-22 00:04:34,044 INFO L387 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 230 treesize of output 198 [2021-12-22 00:04:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-22 00:04:34,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275358379] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:04:34,110 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:04:34,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2021-12-22 00:04:34,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519938314] [2021-12-22 00:04:34,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:04:34,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-22 00:04:34,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-22 00:04:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=974, Unknown=21, NotChecked=198, Total=1332 [2021-12-22 00:04:34,113 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) [2021-12-22 00:04:41,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse7 (= .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse8 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10) 0))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_25| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_25|) 0)) (and (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_5) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_prenex_4)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_558))) (= (select (select (let ((.cse2 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_25| 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 .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) (forall ((v_ArrVal_559 (Array Int Int)) (v_ArrVal_558 (Array Int Int)) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse6 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6))) (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_559) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_561) (select (select (store (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_558) |v_ULTIMATE.start_main_~tmpList~0#1.base_25| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_562)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6)) 0))))) (not .cse7) (or .cse8 .cse7) (= (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) 1) .cse8 (= (select |c_#length| .cse9) 4))))) is different from false [2021-12-22 00:04:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:43,002 INFO L93 Difference]: Finished difference Result 1105 states and 1577 transitions. [2021-12-22 00:04:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 00:04:43,003 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 [2021-12-22 00:04:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:43,008 INFO L225 Difference]: With dead ends: 1105 [2021-12-22 00:04:43,008 INFO L226 Difference]: Without dead ends: 1105 [2021-12-22 00:04:43,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=329, Invalid=1821, Unknown=28, NotChecked=372, Total=2550 [2021-12-22 00:04:43,010 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 1292 mSDsluCounter, 2420 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 4362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2356 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:43,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1292 Valid, 2585 Invalid, 4362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1942 Invalid, 0 Unknown, 2356 Unchecked, 1.1s Time] [2021-12-22 00:04:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-12-22 00:04:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 363. [2021-12-22 00:04:43,019 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) [2021-12-22 00:04:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 530 transitions. [2021-12-22 00:04:43,020 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 530 transitions. Word has length 24 [2021-12-22 00:04:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:43,020 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 530 transitions. [2021-12-22 00:04:43,021 INFO L471 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) [2021-12-22 00:04:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 530 transitions. [2021-12-22 00:04:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-22 00:04:43,021 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:43,021 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:43,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 00:04:43,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-22 00:04:43,235 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -354718400, now seen corresponding path program 1 times [2021-12-22 00:04:43,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:43,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655495733] [2021-12-22 00:04:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:43,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:43,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:43,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655495733] [2021-12-22 00:04:43,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655495733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:43,269 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:43,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:43,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131966842] [2021-12-22 00:04:43,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:43,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:43,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:43,270 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) [2021-12-22 00:04:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:43,278 INFO L93 Difference]: Finished difference Result 366 states and 533 transitions. [2021-12-22 00:04:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:43,278 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 [2021-12-22 00:04:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:43,280 INFO L225 Difference]: With dead ends: 366 [2021-12-22 00:04:43,280 INFO L226 Difference]: Without dead ends: 366 [2021-12-22 00:04:43,280 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:43,281 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:43,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:04:43,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-22 00:04:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-22 00:04:43,286 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) [2021-12-22 00:04:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 533 transitions. [2021-12-22 00:04:43,287 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 533 transitions. Word has length 24 [2021-12-22 00:04:43,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:43,288 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 533 transitions. [2021-12-22 00:04:43,288 INFO L471 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) [2021-12-22 00:04:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 533 transitions. [2021-12-22 00:04:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-22 00:04:43,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:43,289 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:43,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 00:04:43,290 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:43,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1183191976, now seen corresponding path program 1 times [2021-12-22 00:04:43,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:43,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507601627] [2021-12-22 00:04:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:43,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:43,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:43,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507601627] [2021-12-22 00:04:43,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507601627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:43,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:43,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:43,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889544537] [2021-12-22 00:04:43,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:43,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:43,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:43,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:43,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:43,332 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) [2021-12-22 00:04:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:43,347 INFO L93 Difference]: Finished difference Result 409 states and 562 transitions. [2021-12-22 00:04:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:43,347 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 [2021-12-22 00:04:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:43,349 INFO L225 Difference]: With dead ends: 409 [2021-12-22 00:04:43,349 INFO L226 Difference]: Without dead ends: 409 [2021-12-22 00:04:43,349 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:43,350 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:43,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 351 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:04:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-22 00:04:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 355. [2021-12-22 00:04:43,358 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) [2021-12-22 00:04:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 509 transitions. [2021-12-22 00:04:43,359 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 509 transitions. Word has length 25 [2021-12-22 00:04:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:43,360 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 509 transitions. [2021-12-22 00:04:43,360 INFO L471 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) [2021-12-22 00:04:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 509 transitions. [2021-12-22 00:04:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 00:04:43,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:43,362 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:43,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-22 00:04:43,362 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 808555227, now seen corresponding path program 1 times [2021-12-22 00:04:43,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:43,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924440223] [2021-12-22 00:04:43,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:43,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:43,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:43,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:43,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924440223] [2021-12-22 00:04:43,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924440223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:43,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:43,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:04:43,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169433303] [2021-12-22 00:04:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:43,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:04:43,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:04:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:04:43,502 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) [2021-12-22 00:04:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:44,032 INFO L93 Difference]: Finished difference Result 615 states and 802 transitions. [2021-12-22 00:04:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 00:04:44,033 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 [2021-12-22 00:04:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:44,035 INFO L225 Difference]: With dead ends: 615 [2021-12-22 00:04:44,035 INFO L226 Difference]: Without dead ends: 615 [2021-12-22 00:04:44,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-22 00:04:44,036 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 584 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:44,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [584 Valid, 966 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:44,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-22 00:04:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 440. [2021-12-22 00:04:44,042 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) [2021-12-22 00:04:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 648 transitions. [2021-12-22 00:04:44,043 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 648 transitions. Word has length 26 [2021-12-22 00:04:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:44,044 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 648 transitions. [2021-12-22 00:04:44,044 INFO L471 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) [2021-12-22 00:04:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 648 transitions. [2021-12-22 00:04:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 00:04:44,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:44,045 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:44,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-22 00:04:44,045 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:44,046 INFO L85 PathProgramCache]: Analyzing trace with hash -645242845, now seen corresponding path program 1 times [2021-12-22 00:04:44,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:44,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189877527] [2021-12-22 00:04:44,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:44,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:44,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:44,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189877527] [2021-12-22 00:04:44,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189877527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:44,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:44,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:04:44,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603734059] [2021-12-22 00:04:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:44,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:04:44,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:04:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:04:44,184 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) [2021-12-22 00:04:44,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:44,732 INFO L93 Difference]: Finished difference Result 575 states and 752 transitions. [2021-12-22 00:04:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 00:04:44,732 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 [2021-12-22 00:04:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:44,734 INFO L225 Difference]: With dead ends: 575 [2021-12-22 00:04:44,734 INFO L226 Difference]: Without dead ends: 575 [2021-12-22 00:04:44,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:04:44,735 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 341 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:44,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1317 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-12-22 00:04:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 413. [2021-12-22 00:04:44,741 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) [2021-12-22 00:04:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 604 transitions. [2021-12-22 00:04:44,742 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 604 transitions. Word has length 26 [2021-12-22 00:04:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:44,742 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 604 transitions. [2021-12-22 00:04:44,743 INFO L471 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) [2021-12-22 00:04:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 604 transitions. [2021-12-22 00:04:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:04:44,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:44,743 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:44,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-22 00:04:44,744 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310097, now seen corresponding path program 1 times [2021-12-22 00:04:44,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:44,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709994147] [2021-12-22 00:04:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:44,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:44,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:44,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709994147] [2021-12-22 00:04:44,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709994147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:44,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:44,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:04:44,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216053754] [2021-12-22 00:04:44,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:44,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:04:44,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:44,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:04:44,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:04:44,841 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) [2021-12-22 00:04:45,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:45,358 INFO L93 Difference]: Finished difference Result 614 states and 871 transitions. [2021-12-22 00:04:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:04:45,359 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 [2021-12-22 00:04:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:45,361 INFO L225 Difference]: With dead ends: 614 [2021-12-22 00:04:45,361 INFO L226 Difference]: Without dead ends: 614 [2021-12-22 00:04:45,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-12-22 00:04:45,362 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 509 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:45,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 791 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-12-22 00:04:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 422. [2021-12-22 00:04:45,368 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) [2021-12-22 00:04:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 615 transitions. [2021-12-22 00:04:45,369 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 615 transitions. Word has length 27 [2021-12-22 00:04:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:45,370 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 615 transitions. [2021-12-22 00:04:45,370 INFO L471 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) [2021-12-22 00:04:45,370 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2021-12-22 00:04:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:04:45,370 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:45,371 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:45,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-22 00:04:45,371 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:45,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310096, now seen corresponding path program 1 times [2021-12-22 00:04:45,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:45,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70410391] [2021-12-22 00:04:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:45,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:45,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:45,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70410391] [2021-12-22 00:04:45,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70410391] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:45,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:45,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:04:45,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995917408] [2021-12-22 00:04:45,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:45,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:04:45,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:04:45,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:04:45,525 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) [2021-12-22 00:04:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:46,108 INFO L93 Difference]: Finished difference Result 617 states and 874 transitions. [2021-12-22 00:04:46,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:04:46,115 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 [2021-12-22 00:04:46,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:46,118 INFO L225 Difference]: With dead ends: 617 [2021-12-22 00:04:46,118 INFO L226 Difference]: Without dead ends: 617 [2021-12-22 00:04:46,119 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:04:46,120 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 570 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:46,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 598 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 00:04:46,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-22 00:04:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2021-12-22 00:04:46,128 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) [2021-12-22 00:04:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 614 transitions. [2021-12-22 00:04:46,129 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 614 transitions. Word has length 27 [2021-12-22 00:04:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:46,129 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 614 transitions. [2021-12-22 00:04:46,129 INFO L471 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) [2021-12-22 00:04:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 614 transitions. [2021-12-22 00:04:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:04:46,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:46,129 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:46,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-22 00:04:46,130 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -114590158, now seen corresponding path program 1 times [2021-12-22 00:04:46,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661684915] [2021-12-22 00:04:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:46,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:46,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661684915] [2021-12-22 00:04:46,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661684915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:46,158 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:46,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:46,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130670446] [2021-12-22 00:04:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:46,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:46,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:46,160 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) [2021-12-22 00:04:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:46,167 INFO L93 Difference]: Finished difference Result 426 states and 618 transitions. [2021-12-22 00:04:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:46,167 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 [2021-12-22 00:04:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:46,169 INFO L225 Difference]: With dead ends: 426 [2021-12-22 00:04:46,169 INFO L226 Difference]: Without dead ends: 426 [2021-12-22 00:04:46,169 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:46,170 INFO L933 BasicCegarLoop]: 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 [2021-12-22 00:04:46,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:04:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-12-22 00:04:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-12-22 00:04:46,175 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) [2021-12-22 00:04:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 618 transitions. [2021-12-22 00:04:46,176 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 618 transitions. Word has length 27 [2021-12-22 00:04:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:46,177 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 618 transitions. [2021-12-22 00:04:46,177 INFO L471 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) [2021-12-22 00:04:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 618 transitions. [2021-12-22 00:04:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:04:46,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:46,177 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:46,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-22 00:04:46,178 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:46,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -114649740, now seen corresponding path program 1 times [2021-12-22 00:04:46,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:46,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284048498] [2021-12-22 00:04:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:46,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:46,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:46,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284048498] [2021-12-22 00:04:46,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284048498] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:46,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:46,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:46,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11401762] [2021-12-22 00:04:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:46,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:46,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:46,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:46,204 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) [2021-12-22 00:04:46,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:46,314 INFO L93 Difference]: Finished difference Result 628 states and 919 transitions. [2021-12-22 00:04:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:46,315 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 [2021-12-22 00:04:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:46,317 INFO L225 Difference]: With dead ends: 628 [2021-12-22 00:04:46,317 INFO L226 Difference]: Without dead ends: 628 [2021-12-22 00:04:46,317 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:46,318 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:46,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-12-22 00:04:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 421. [2021-12-22 00:04:46,325 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) [2021-12-22 00:04:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 613 transitions. [2021-12-22 00:04:46,326 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 613 transitions. Word has length 27 [2021-12-22 00:04:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:46,327 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 613 transitions. [2021-12-22 00:04:46,327 INFO L471 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) [2021-12-22 00:04:46,327 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 613 transitions. [2021-12-22 00:04:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-22 00:04:46,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:46,327 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:46,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-22 00:04:46,328 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash -114649739, now seen corresponding path program 1 times [2021-12-22 00:04:46,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:46,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918996843] [2021-12-22 00:04:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:46,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:46,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918996843] [2021-12-22 00:04:46,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918996843] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:46,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:46,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:04:46,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155644890] [2021-12-22 00:04:46,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:46,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:04:46,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:04:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:04:46,364 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) [2021-12-22 00:04:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:46,454 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2021-12-22 00:04:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:04:46,454 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 [2021-12-22 00:04:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:46,456 INFO L225 Difference]: With dead ends: 419 [2021-12-22 00:04:46,456 INFO L226 Difference]: Without dead ends: 419 [2021-12-22 00:04:46,456 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:46,456 INFO L933 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:46,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 253 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-22 00:04:46,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-12-22 00:04:46,462 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) [2021-12-22 00:04:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 611 transitions. [2021-12-22 00:04:46,463 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 611 transitions. Word has length 27 [2021-12-22 00:04:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:46,464 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 611 transitions. [2021-12-22 00:04:46,464 INFO L471 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) [2021-12-22 00:04:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 611 transitions. [2021-12-22 00:04:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:04:46,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:46,464 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:04:46,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-22 00:04:46,465 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -127169272, now seen corresponding path program 1 times [2021-12-22 00:04:46,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:46,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964503579] [2021-12-22 00:04:46,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:46,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:46,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964503579] [2021-12-22 00:04:46,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964503579] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:04:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473979288] [2021-12-22 00:04:46,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:46,574 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:46,576 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) [2021-12-22 00:04:46,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 00:04:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-22 00:04:46,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:04:46,741 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:46,741 INFO L387 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 [2021-12-22 00:04:46,769 INFO L387 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 [2021-12-22 00:04:46,772 INFO L387 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 [2021-12-22 00:04:46,787 INFO L387 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 [2021-12-22 00:04:46,789 INFO L387 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 [2021-12-22 00:04:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:46,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:04:46,815 WARN L838 $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 [2021-12-22 00:04:46,829 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:04:46,829 INFO L387 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 [2021-12-22 00:04:46,901 INFO L387 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 53 treesize of output 47 [2021-12-22 00:04:46,904 INFO L387 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 72 treesize of output 54 [2021-12-22 00:04:46,908 INFO L387 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 45 treesize of output 41 [2021-12-22 00:04:46,910 INFO L387 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 41 treesize of output 37 [2021-12-22 00:04:46,915 INFO L387 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 37 treesize of output 33 [2021-12-22 00:04:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-22 00:04:46,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473979288] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:04:46,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:04:46,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-12-22 00:04:46,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648729243] [2021-12-22 00:04:46,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:04:46,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:04:46,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:46,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:04:46,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2021-12-22 00:04:46,971 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) [2021-12-22 00:04:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:47,504 INFO L93 Difference]: Finished difference Result 880 states and 1268 transitions. [2021-12-22 00:04:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:04:47,504 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 [2021-12-22 00:04:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:47,506 INFO L225 Difference]: With dead ends: 880 [2021-12-22 00:04:47,506 INFO L226 Difference]: Without dead ends: 880 [2021-12-22 00:04:47,506 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=176, Unknown=1, NotChecked=28, Total=272 [2021-12-22 00:04:47,507 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 332 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:47,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 1036 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 747 Invalid, 0 Unknown, 494 Unchecked, 0.4s Time] [2021-12-22 00:04:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-12-22 00:04:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 412. [2021-12-22 00:04:47,515 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) [2021-12-22 00:04:47,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2021-12-22 00:04:47,516 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 28 [2021-12-22 00:04:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:47,517 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2021-12-22 00:04:47,517 INFO L471 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) [2021-12-22 00:04:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2021-12-22 00:04:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:04:47,517 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:47,517 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:47,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:04:47,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:47,735 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash -287836000, now seen corresponding path program 1 times [2021-12-22 00:04:47,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:47,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817205800] [2021-12-22 00:04:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:47,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:47,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:47,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817205800] [2021-12-22 00:04:47,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817205800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:47,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:47,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:04:47,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972012079] [2021-12-22 00:04:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:47,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:04:47,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:47,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:04:47,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:04:47,818 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) [2021-12-22 00:04:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:48,026 INFO L93 Difference]: Finished difference Result 519 states and 766 transitions. [2021-12-22 00:04:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:04:48,027 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 [2021-12-22 00:04:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:48,028 INFO L225 Difference]: With dead ends: 519 [2021-12-22 00:04:48,028 INFO L226 Difference]: Without dead ends: 519 [2021-12-22 00:04:48,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:04:48,029 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:48,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 513 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-12-22 00:04:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 421. [2021-12-22 00:04:48,038 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) [2021-12-22 00:04:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-12-22 00:04:48,039 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 28 [2021-12-22 00:04:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:48,039 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-12-22 00:04:48,040 INFO L471 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) [2021-12-22 00:04:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-12-22 00:04:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:04:48,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:48,040 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:48,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-22 00:04:48,041 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:48,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash -287651302, now seen corresponding path program 1 times [2021-12-22 00:04:48,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:48,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454472208] [2021-12-22 00:04:48,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:48,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:48,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:48,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454472208] [2021-12-22 00:04:48,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454472208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:48,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:48,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 00:04:48,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309374093] [2021-12-22 00:04:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:48,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:04:48,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:48,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:04:48,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:04:48,205 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) [2021-12-22 00:04:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:48,718 INFO L93 Difference]: Finished difference Result 547 states and 761 transitions. [2021-12-22 00:04:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:04:48,718 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 [2021-12-22 00:04:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:48,720 INFO L225 Difference]: With dead ends: 547 [2021-12-22 00:04:48,720 INFO L226 Difference]: Without dead ends: 547 [2021-12-22 00:04:48,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-12-22 00:04:48,721 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 297 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:48,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 981 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-12-22 00:04:48,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2021-12-22 00:04:48,727 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) [2021-12-22 00:04:48,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2021-12-22 00:04:48,728 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 28 [2021-12-22 00:04:48,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:48,728 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2021-12-22 00:04:48,729 INFO L471 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) [2021-12-22 00:04:48,729 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2021-12-22 00:04:48,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:04:48,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:48,729 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:48,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-22 00:04:48,729 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:48,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash 485465518, now seen corresponding path program 1 times [2021-12-22 00:04:48,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:48,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587163818] [2021-12-22 00:04:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:48,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:48,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:48,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587163818] [2021-12-22 00:04:48,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587163818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:48,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:48,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:04:48,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994682253] [2021-12-22 00:04:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:48,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:04:48,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:04:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:04:48,862 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) [2021-12-22 00:04:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:49,237 INFO L93 Difference]: Finished difference Result 546 states and 760 transitions. [2021-12-22 00:04:49,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 00:04:49,237 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 [2021-12-22 00:04:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:49,238 INFO L225 Difference]: With dead ends: 546 [2021-12-22 00:04:49,238 INFO L226 Difference]: Without dead ends: 546 [2021-12-22 00:04:49,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-22 00:04:49,239 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 407 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:49,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 745 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:04:49,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-22 00:04:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 383. [2021-12-22 00:04:49,245 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) [2021-12-22 00:04:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 546 transitions. [2021-12-22 00:04:49,246 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 546 transitions. Word has length 30 [2021-12-22 00:04:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:49,246 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 546 transitions. [2021-12-22 00:04:49,246 INFO L471 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) [2021-12-22 00:04:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 546 transitions. [2021-12-22 00:04:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:04:49,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:49,247 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:49,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-22 00:04:49,247 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 485466609, now seen corresponding path program 1 times [2021-12-22 00:04:49,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:49,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170418327] [2021-12-22 00:04:49,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:49,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:49,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170418327] [2021-12-22 00:04:49,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170418327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:49,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:49,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:49,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796158401] [2021-12-22 00:04:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:49,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:49,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:49,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:49,287 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) [2021-12-22 00:04:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:49,458 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2021-12-22 00:04:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:04:49,459 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 [2021-12-22 00:04:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:49,460 INFO L225 Difference]: With dead ends: 382 [2021-12-22 00:04:49,460 INFO L226 Difference]: Without dead ends: 382 [2021-12-22 00:04:49,460 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:49,461 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:49,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 384 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-22 00:04:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2021-12-22 00:04:49,466 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) [2021-12-22 00:04:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 542 transitions. [2021-12-22 00:04:49,467 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 542 transitions. Word has length 30 [2021-12-22 00:04:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:49,467 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 542 transitions. [2021-12-22 00:04:49,467 INFO L471 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) [2021-12-22 00:04:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 542 transitions. [2021-12-22 00:04:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:04:49,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:49,468 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:49,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-22 00:04:49,468 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 485466610, now seen corresponding path program 1 times [2021-12-22 00:04:49,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15733532] [2021-12-22 00:04:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:49,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:49,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15733532] [2021-12-22 00:04:49,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15733532] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:49,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:49,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:49,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778047469] [2021-12-22 00:04:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:49,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:49,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:49,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:49,526 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) [2021-12-22 00:04:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:49,690 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2021-12-22 00:04:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:04:49,691 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 [2021-12-22 00:04:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:49,692 INFO L225 Difference]: With dead ends: 381 [2021-12-22 00:04:49,692 INFO L226 Difference]: Without dead ends: 381 [2021-12-22 00:04:49,692 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:49,693 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:49,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-22 00:04:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-22 00:04:49,697 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) [2021-12-22 00:04:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2021-12-22 00:04:49,698 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 30 [2021-12-22 00:04:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:49,699 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2021-12-22 00:04:49,699 INFO L471 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) [2021-12-22 00:04:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2021-12-22 00:04:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-22 00:04:49,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:49,700 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:49,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-22 00:04:49,700 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1031290720, now seen corresponding path program 1 times [2021-12-22 00:04:49,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:49,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123017821] [2021-12-22 00:04:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:49,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:49,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123017821] [2021-12-22 00:04:49,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123017821] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:49,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:49,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839212967] [2021-12-22 00:04:49,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:04:49,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:04:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:04:49,744 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) [2021-12-22 00:04:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:49,929 INFO L93 Difference]: Finished difference Result 800 states and 1167 transitions. [2021-12-22 00:04:49,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:04:49,929 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 [2021-12-22 00:04:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:49,932 INFO L225 Difference]: With dead ends: 800 [2021-12-22 00:04:49,932 INFO L226 Difference]: Without dead ends: 800 [2021-12-22 00:04:49,932 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:49,933 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 198 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:49,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 367 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:49,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-22 00:04:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 378. [2021-12-22 00:04:49,945 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) [2021-12-22 00:04:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 535 transitions. [2021-12-22 00:04:49,946 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 535 transitions. Word has length 30 [2021-12-22 00:04:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:49,947 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 535 transitions. [2021-12-22 00:04:49,947 INFO L471 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) [2021-12-22 00:04:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2021-12-22 00:04:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-22 00:04:49,947 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:49,947 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:49,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-22 00:04:49,948 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2130437780, now seen corresponding path program 1 times [2021-12-22 00:04:49,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:49,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502677151] [2021-12-22 00:04:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:49,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:50,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502677151] [2021-12-22 00:04:50,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502677151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:50,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:50,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:04:50,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805879758] [2021-12-22 00:04:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:50,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:04:50,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:04:50,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:04:50,025 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) [2021-12-22 00:04:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:50,452 INFO L93 Difference]: Finished difference Result 532 states and 738 transitions. [2021-12-22 00:04:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 00:04:50,453 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 [2021-12-22 00:04:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:50,454 INFO L225 Difference]: With dead ends: 532 [2021-12-22 00:04:50,454 INFO L226 Difference]: Without dead ends: 532 [2021-12-22 00:04:50,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:04:50,455 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 251 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:50,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 769 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:50,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-12-22 00:04:50,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2021-12-22 00:04:50,459 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) [2021-12-22 00:04:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 536 transitions. [2021-12-22 00:04:50,460 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 536 transitions. Word has length 31 [2021-12-22 00:04:50,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:50,460 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 536 transitions. [2021-12-22 00:04:50,460 INFO L471 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) [2021-12-22 00:04:50,461 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 536 transitions. [2021-12-22 00:04:50,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-22 00:04:50,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:50,461 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:50,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-22 00:04:50,461 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1619061392, now seen corresponding path program 1 times [2021-12-22 00:04:50,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595234463] [2021-12-22 00:04:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:50,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:50,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:50,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595234463] [2021-12-22 00:04:50,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595234463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:50,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:50,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:50,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787309832] [2021-12-22 00:04:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:50,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:50,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:50,494 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) [2021-12-22 00:04:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:50,669 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2021-12-22 00:04:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:04:50,669 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 [2021-12-22 00:04:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:50,671 INFO L225 Difference]: With dead ends: 378 [2021-12-22 00:04:50,671 INFO L226 Difference]: Without dead ends: 378 [2021-12-22 00:04:50,671 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:50,671 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:50,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:04:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-12-22 00:04:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2021-12-22 00:04:50,675 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) [2021-12-22 00:04:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 532 transitions. [2021-12-22 00:04:50,676 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 532 transitions. Word has length 32 [2021-12-22 00:04:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:50,677 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 532 transitions. [2021-12-22 00:04:50,677 INFO L471 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) [2021-12-22 00:04:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 532 transitions. [2021-12-22 00:04:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:04:50,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:50,677 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:50,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-22 00:04:50,677 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:50,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121302, now seen corresponding path program 1 times [2021-12-22 00:04:50,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:50,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835824249] [2021-12-22 00:04:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:50,678 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:50,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835824249] [2021-12-22 00:04:50,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835824249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:50,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:50,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-22 00:04:50,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496314120] [2021-12-22 00:04:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:50,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 00:04:50,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 00:04:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:04:50,938 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) [2021-12-22 00:04:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:52,061 INFO L93 Difference]: Finished difference Result 775 states and 1015 transitions. [2021-12-22 00:04:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-22 00:04:52,062 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 [2021-12-22 00:04:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:52,064 INFO L225 Difference]: With dead ends: 775 [2021-12-22 00:04:52,064 INFO L226 Difference]: Without dead ends: 775 [2021-12-22 00:04:52,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1271, Unknown=0, NotChecked=0, Total=1482 [2021-12-22 00:04:52,065 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 1013 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:52,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1013 Valid, 1458 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-22 00:04:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2021-12-22 00:04:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 383. [2021-12-22 00:04:52,071 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) [2021-12-22 00:04:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 538 transitions. [2021-12-22 00:04:52,072 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 538 transitions. Word has length 33 [2021-12-22 00:04:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:52,072 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 538 transitions. [2021-12-22 00:04:52,073 INFO L471 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) [2021-12-22 00:04:52,073 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2021-12-22 00:04:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-22 00:04:52,073 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:52,073 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:52,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-22 00:04:52,074 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121303, now seen corresponding path program 1 times [2021-12-22 00:04:52,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:52,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511569021] [2021-12-22 00:04:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:52,075 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:52,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:52,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:52,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511569021] [2021-12-22 00:04:52,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511569021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:52,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:52,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 00:04:52,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62964106] [2021-12-22 00:04:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:52,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:04:52,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:52,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:04:52,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:04:52,211 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) [2021-12-22 00:04:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:52,782 INFO L93 Difference]: Finished difference Result 518 states and 719 transitions. [2021-12-22 00:04:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 00:04:52,782 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 [2021-12-22 00:04:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:52,783 INFO L225 Difference]: With dead ends: 518 [2021-12-22 00:04:52,783 INFO L226 Difference]: Without dead ends: 518 [2021-12-22 00:04:52,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-12-22 00:04:52,784 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 267 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:52,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1151 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:04:52,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-12-22 00:04:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2021-12-22 00:04:52,790 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) [2021-12-22 00:04:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 531 transitions. [2021-12-22 00:04:52,791 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 531 transitions. Word has length 33 [2021-12-22 00:04:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:52,791 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 531 transitions. [2021-12-22 00:04:52,791 INFO L471 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) [2021-12-22 00:04:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 531 transitions. [2021-12-22 00:04:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 00:04:52,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:52,792 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:52,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-22 00:04:52,792 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1139825358, now seen corresponding path program 1 times [2021-12-22 00:04:52,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:52,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133863323] [2021-12-22 00:04:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:52,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:52,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133863323] [2021-12-22 00:04:52,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133863323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:52,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:52,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:04:52,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327484038] [2021-12-22 00:04:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:52,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:04:52,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:52,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:04:52,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:04:52,823 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) [2021-12-22 00:04:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:52,971 INFO L93 Difference]: Finished difference Result 535 states and 669 transitions. [2021-12-22 00:04:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:04:52,972 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 [2021-12-22 00:04:52,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:52,979 INFO L225 Difference]: With dead ends: 535 [2021-12-22 00:04:52,979 INFO L226 Difference]: Without dead ends: 535 [2021-12-22 00:04:52,979 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:52,980 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 326 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:52,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 336 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-12-22 00:04:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 400. [2021-12-22 00:04:52,985 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) [2021-12-22 00:04:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2021-12-22 00:04:52,986 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 34 [2021-12-22 00:04:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:52,986 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2021-12-22 00:04:52,986 INFO L471 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) [2021-12-22 00:04:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2021-12-22 00:04:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 00:04:52,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:52,987 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:52,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-22 00:04:52,987 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400092, now seen corresponding path program 1 times [2021-12-22 00:04:52,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703841825] [2021-12-22 00:04:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:52,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:53,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:53,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:53,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703841825] [2021-12-22 00:04:53,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703841825] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:53,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:53,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:53,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670283074] [2021-12-22 00:04:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:53,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:53,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:53,049 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) [2021-12-22 00:04:53,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:53,211 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2021-12-22 00:04:53,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:04:53,212 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 [2021-12-22 00:04:53,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:53,213 INFO L225 Difference]: With dead ends: 399 [2021-12-22 00:04:53,213 INFO L226 Difference]: Without dead ends: 399 [2021-12-22 00:04:53,213 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:53,213 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:53,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 409 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-12-22 00:04:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2021-12-22 00:04:53,218 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) [2021-12-22 00:04:53,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 571 transitions. [2021-12-22 00:04:53,218 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 571 transitions. Word has length 34 [2021-12-22 00:04:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:53,219 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 571 transitions. [2021-12-22 00:04:53,219 INFO L471 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) [2021-12-22 00:04:53,219 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 571 transitions. [2021-12-22 00:04:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 00:04:53,219 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:53,219 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:53,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-22 00:04:53,220 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400093, now seen corresponding path program 1 times [2021-12-22 00:04:53,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:53,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936409840] [2021-12-22 00:04:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:53,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:53,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:53,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936409840] [2021-12-22 00:04:53,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936409840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:04:53,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:04:53,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:04:53,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941502361] [2021-12-22 00:04:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:04:53,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:04:53,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:53,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:04:53,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:04:53,261 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) [2021-12-22 00:04:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:53,379 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2021-12-22 00:04:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:04:53,380 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 [2021-12-22 00:04:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:53,381 INFO L225 Difference]: With dead ends: 398 [2021-12-22 00:04:53,381 INFO L226 Difference]: Without dead ends: 398 [2021-12-22 00:04:53,382 INFO L932 BasicCegarLoop]: 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 [2021-12-22 00:04:53,386 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:53,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 439 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:04:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-22 00:04:53,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-12-22 00:04:53,391 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) [2021-12-22 00:04:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 570 transitions. [2021-12-22 00:04:53,392 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 570 transitions. Word has length 34 [2021-12-22 00:04:53,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:53,392 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 570 transitions. [2021-12-22 00:04:53,392 INFO L471 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) [2021-12-22 00:04:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 570 transitions. [2021-12-22 00:04:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:04:53,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:53,393 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:53,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-22 00:04:53,393 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 191313679, now seen corresponding path program 1 times [2021-12-22 00:04:53,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410480694] [2021-12-22 00:04:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:53,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:53,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:53,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410480694] [2021-12-22 00:04:53,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410480694] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:04:53,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941292337] [2021-12-22 00:04:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:53,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:53,576 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) [2021-12-22 00:04:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 00:04:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:53,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-22 00:04:53,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:04:53,735 INFO L387 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 [2021-12-22 00:04:53,763 INFO L387 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 [2021-12-22 00:04:53,766 INFO L387 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 [2021-12-22 00:04:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,795 INFO L387 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 [2021-12-22 00:04:53,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,803 INFO L387 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 [2021-12-22 00:04:53,848 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:53,849 INFO L387 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 [2021-12-22 00:04:53,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,892 INFO L387 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 [2021-12-22 00:04:53,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:53,903 INFO L387 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 [2021-12-22 00:04:54,054 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:54,054 INFO L387 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 [2021-12-22 00:04:54,062 INFO L387 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 [2021-12-22 00:04:54,127 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:54,127 INFO L387 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 [2021-12-22 00:04:54,291 INFO L387 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 [2021-12-22 00:04:54,296 INFO L387 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 [2021-12-22 00:04:54,453 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:04:54,453 INFO L387 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 [2021-12-22 00:04:54,459 INFO L387 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 [2021-12-22 00:04:54,645 INFO L387 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 [2021-12-22 00:04:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:54,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:04:54,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((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) (forall ((v_ArrVal_1488 (Array Int Int))) (= (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 [2021-12-22 00:04:55,010 WARN L838 $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 [2021-12-22 00:04:55,067 WARN L838 $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))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-22 00:04:55,081 INFO L353 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-22 00:04:55,082 INFO L387 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 [2021-12-22 00:04:55,106 WARN L838 $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 [2021-12-22 00:04:55,138 WARN L838 $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 [2021-12-22 00:04:55,869 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:04:55,870 INFO L387 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 [2021-12-22 00:04:55,980 WARN L838 $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 [2021-12-22 00:04:56,330 WARN L838 $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 [2021-12-22 00:04:56,691 WARN L838 $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 [2021-12-22 00:04:56,726 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-22 00:04:56,727 INFO L387 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 221 treesize of output 141 [2021-12-22 00:04:56,753 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-22 00:04:56,753 INFO L387 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 141 treesize of output 151 [2021-12-22 00:04:56,757 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:04:56,764 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-22 00:04:56,764 INFO L387 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 591 treesize of output 461 [2021-12-22 00:04:56,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:04:56,776 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-22 00:04:56,777 INFO L387 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 545 treesize of output 521 [2021-12-22 00:04:56,795 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 00:04:56,796 INFO L387 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 521 treesize of output 435 [2021-12-22 00:04:56,802 INFO L387 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 435 treesize of output 423 [2021-12-22 00:04:56,818 INFO L387 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 50 treesize of output 48 [2021-12-22 00:04:56,823 INFO L387 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 48 treesize of output 46 [2021-12-22 00:04:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:56,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941292337] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:04:56,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:04:56,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-22 00:04:56,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82843804] [2021-12-22 00:04:56,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:04:56,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-22 00:04:56,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:04:56,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-22 00:04:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1170, Unknown=16, NotChecked=616, Total=1980 [2021-12-22 00:04:56,884 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) [2021-12-22 00:04:56,972 WARN L838 $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 [2021-12-22 00:04:59,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:04:59,190 INFO L93 Difference]: Finished difference Result 800 states and 1052 transitions. [2021-12-22 00:04:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-22 00:04:59,191 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 [2021-12-22 00:04:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:04:59,192 INFO L225 Difference]: With dead ends: 800 [2021-12-22 00:04:59,192 INFO L226 Difference]: Without dead ends: 800 [2021-12-22 00:04:59,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 72 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=714, Invalid=3465, Unknown=17, NotChecked=1206, Total=5402 [2021-12-22 00:04:59,194 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 1386 mSDsluCounter, 2430 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 2549 SdHoareTripleChecker+Invalid, 6950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3759 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:04:59,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1386 Valid, 2549 Invalid, 6950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3064 Invalid, 0 Unknown, 3759 Unchecked, 1.4s Time] [2021-12-22 00:04:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-22 00:04:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 486. [2021-12-22 00:04:59,200 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) [2021-12-22 00:04:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 711 transitions. [2021-12-22 00:04:59,202 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 711 transitions. Word has length 35 [2021-12-22 00:04:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:04:59,202 INFO L470 AbstractCegarLoop]: Abstraction has 486 states and 711 transitions. [2021-12-22 00:04:59,202 INFO L471 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) [2021-12-22 00:04:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 711 transitions. [2021-12-22 00:04:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:04:59,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:04:59,203 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:04:59,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:04:59,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:59,421 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:04:59,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:04:59,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1262484393, now seen corresponding path program 1 times [2021-12-22 00:04:59,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:04:59,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123554405] [2021-12-22 00:04:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:59,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:04:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:04:59,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:04:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123554405] [2021-12-22 00:04:59,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123554405] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:04:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817805573] [2021-12-22 00:04:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:04:59,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:04:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:04:59,620 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) [2021-12-22 00:04:59,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 00:04:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:04:59,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-22 00:04:59,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:04:59,793 INFO L387 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 [2021-12-22 00:04:59,814 INFO L387 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 [2021-12-22 00:04:59,819 INFO L387 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 [2021-12-22 00:04:59,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,842 INFO L387 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 [2021-12-22 00:04:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,849 INFO L387 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 [2021-12-22 00:04:59,888 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:04:59,889 INFO L387 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 [2021-12-22 00:04:59,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,941 INFO L387 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 [2021-12-22 00:04:59,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-22 00:04:59,951 INFO L387 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 [2021-12-22 00:05:00,118 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:00,118 INFO L387 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 [2021-12-22 00:05:00,122 INFO L387 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 [2021-12-22 00:05:00,197 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:05:00,198 INFO L387 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 [2021-12-22 00:05:00,376 INFO L387 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 [2021-12-22 00:05:00,381 INFO L387 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 [2021-12-22 00:05:00,534 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:00,535 INFO L387 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 [2021-12-22 00:05:00,538 INFO L387 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 [2021-12-22 00:05:00,718 INFO L387 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 [2021-12-22 00:05:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:00,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:05:01,051 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (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 (and (= .cse0 0) (forall ((v_ArrVal_1590 (Array Int Int))) (= (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))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-22 00:05:01,071 WARN L838 $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 [2021-12-22 00:05:01,119 WARN L838 $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))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-22 00:05:01,132 INFO L353 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-22 00:05:01,133 INFO L387 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 [2021-12-22 00:05:01,154 WARN L838 $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 [2021-12-22 00:05:01,178 WARN L838 $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 [2021-12-22 00:05:01,889 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:05:01,890 INFO L387 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 [2021-12-22 00:05:01,967 WARN L838 $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 [2021-12-22 00:05:02,796 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-22 00:05:02,796 INFO L387 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 221 treesize of output 141 [2021-12-22 00:05:02,816 INFO L353 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-22 00:05:02,817 INFO L387 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 141 treesize of output 151 [2021-12-22 00:05:02,820 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:02,825 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-22 00:05:02,826 INFO L387 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 499 treesize of output 393 [2021-12-22 00:05:02,830 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:02,836 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-22 00:05:02,836 INFO L387 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 547 treesize of output 519 [2021-12-22 00:05:02,852 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-22 00:05:02,852 INFO L387 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 519 treesize of output 441 [2021-12-22 00:05:02,861 INFO L387 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 441 treesize of output 429 [2021-12-22 00:05:02,878 INFO L387 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 120 treesize of output 112 [2021-12-22 00:05:02,882 INFO L387 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 112 treesize of output 108 [2021-12-22 00:05:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:02,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817805573] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:05:02,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:05:02,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-22 00:05:02,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364681129] [2021-12-22 00:05:02,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:05:02,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-22 00:05:02,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:05:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-22 00:05:02,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1284, Unknown=30, NotChecked=474, Total=1980 [2021-12-22 00:05:02,998 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) [2021-12-22 00:05:03,044 WARN L838 $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 [2021-12-22 00:05:05,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:05:05,128 INFO L93 Difference]: Finished difference Result 824 states and 1092 transitions. [2021-12-22 00:05:05,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-22 00:05:05,128 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 [2021-12-22 00:05:05,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:05:05,130 INFO L225 Difference]: With dead ends: 824 [2021-12-22 00:05:05,130 INFO L226 Difference]: Without dead ends: 824 [2021-12-22 00:05:05,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=693, Invalid=3336, Unknown=31, NotChecked=910, Total=4970 [2021-12-22 00:05:05,131 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 1137 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 5940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3254 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:05:05,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1137 Valid, 2326 Invalid, 5940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2576 Invalid, 0 Unknown, 3254 Unchecked, 1.2s Time] [2021-12-22 00:05:05,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-12-22 00:05:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 458. [2021-12-22 00:05:05,140 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) [2021-12-22 00:05:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 666 transitions. [2021-12-22 00:05:05,141 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 666 transitions. Word has length 35 [2021-12-22 00:05:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:05:05,142 INFO L470 AbstractCegarLoop]: Abstraction has 458 states and 666 transitions. [2021-12-22 00:05:05,142 INFO L471 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) [2021-12-22 00:05:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 666 transitions. [2021-12-22 00:05:05,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-22 00:05:05,142 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:05:05,143 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:05:05,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:05:05,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:05:05,360 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:05:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:05:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash -974847376, now seen corresponding path program 1 times [2021-12-22 00:05:05,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:05:05,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710236346] [2021-12-22 00:05:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:05:05,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:05:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:05:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:05,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:05:05,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710236346] [2021-12-22 00:05:05,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710236346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:05:05,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:05:05,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 00:05:05,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71722207] [2021-12-22 00:05:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:05:05,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-22 00:05:05,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:05:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-22 00:05:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-22 00:05:05,589 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) [2021-12-22 00:05:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:05:06,625 INFO L93 Difference]: Finished difference Result 798 states and 1070 transitions. [2021-12-22 00:05:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-22 00:05:06,625 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 [2021-12-22 00:05:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:05:06,627 INFO L225 Difference]: With dead ends: 798 [2021-12-22 00:05:06,627 INFO L226 Difference]: Without dead ends: 798 [2021-12-22 00:05:06,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2021-12-22 00:05:06,628 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 603 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 00:05:06,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 757 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-22 00:05:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2021-12-22 00:05:06,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 491. [2021-12-22 00:05:06,634 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) [2021-12-22 00:05:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 716 transitions. [2021-12-22 00:05:06,636 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 716 transitions. Word has length 35 [2021-12-22 00:05:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:05:06,636 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 716 transitions. [2021-12-22 00:05:06,636 INFO L471 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) [2021-12-22 00:05:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 716 transitions. [2021-12-22 00:05:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:05:06,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:05:06,637 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:05:06,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-22 00:05:06,637 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:05:06,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:05:06,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038395, now seen corresponding path program 1 times [2021-12-22 00:05:06,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:05:06,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211670575] [2021-12-22 00:05:06,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:05:06,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:05:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:05:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:06,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:05:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211670575] [2021-12-22 00:05:06,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211670575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:05:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668907468] [2021-12-22 00:05:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:05:06,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:05:06,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:05:06,852 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) [2021-12-22 00:05:06,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-22 00:05:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:05:06,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-22 00:05:06,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:05:07,000 INFO L387 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 [2021-12-22 00:05:07,025 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:05:07,026 INFO L387 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 [2021-12-22 00:05:07,043 INFO L387 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 [2021-12-22 00:05:07,103 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:07,104 INFO L387 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 [2021-12-22 00:05:07,138 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:05:07,139 INFO L387 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 [2021-12-22 00:05:07,185 INFO L387 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 [2021-12-22 00:05:07,236 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:07,236 INFO L387 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 [2021-12-22 00:05:07,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:07,452 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:05:07,452 INFO L387 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 [2021-12-22 00:05:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:07,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:05:07,592 INFO L353 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-22 00:05:07,592 INFO L387 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 [2021-12-22 00:05:07,603 WARN L838 $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 [2021-12-22 00:05:07,619 WARN L838 $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 [2021-12-22 00:05:07,652 WARN L838 $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 [2021-12-22 00:05:07,833 WARN L838 $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 [2021-12-22 00:05:07,957 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:05:07,958 INFO L387 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 [2021-12-22 00:05:07,963 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:07,969 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:05:07,969 INFO L387 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 420 treesize of output 318 [2021-12-22 00:05:07,975 INFO L387 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 302 treesize of output 270 [2021-12-22 00:05:07,984 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:05:07,984 INFO L387 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 270 treesize of output 210 [2021-12-22 00:05:07,993 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-22 00:05:07,993 INFO L387 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 [2021-12-22 00:05:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:10,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668907468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:05:10,468 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 00:05:10,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 31 [2021-12-22 00:05:10,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195068425] [2021-12-22 00:05:10,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 00:05:10,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-22 00:05:10,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:05:10,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-22 00:05:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=668, Unknown=8, NotChecked=220, Total=992 [2021-12-22 00:05:10,469 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) [2021-12-22 00:05:11,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:05:11,589 INFO L93 Difference]: Finished difference Result 582 states and 826 transitions. [2021-12-22 00:05:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-22 00:05:11,589 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 [2021-12-22 00:05:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:05:11,591 INFO L225 Difference]: With dead ends: 582 [2021-12-22 00:05:11,591 INFO L226 Difference]: Without dead ends: 582 [2021-12-22 00:05:11,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=349, Invalid=1551, Unknown=8, NotChecked=348, Total=2256 [2021-12-22 00:05:11,591 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 459 mSDsluCounter, 2528 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1247 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-22 00:05:11,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 2700 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1412 Invalid, 0 Unknown, 1247 Unchecked, 0.7s Time] [2021-12-22 00:05:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-22 00:05:11,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 495. [2021-12-22 00:05:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 450 states have (on average 1.6022222222222222) internal successors, (721), 494 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:05:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2021-12-22 00:05:11,596 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 36 [2021-12-22 00:05:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:05:11,596 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2021-12-22 00:05:11,597 INFO L471 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) [2021-12-22 00:05:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2021-12-22 00:05:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:05:11,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:05:11,597 INFO L514 BasicCegarLoop]: 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] [2021-12-22 00:05:11,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-22 00:05:11,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:05:11,807 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-22 00:05:11,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:05:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038396, now seen corresponding path program 1 times [2021-12-22 00:05:11,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:05:11,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524299017] [2021-12-22 00:05:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:05:11,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:05:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:05:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:12,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:05:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524299017] [2021-12-22 00:05:12,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524299017] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 00:05:12,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977355776] [2021-12-22 00:05:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:05:12,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 00:05:12,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:05:12,164 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) [2021-12-22 00:05:12,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-22 00:05:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:05:12,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-22 00:05:12,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:05:12,351 INFO L387 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 [2021-12-22 00:05:12,380 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:05:12,380 INFO L387 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 [2021-12-22 00:05:12,407 INFO L387 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 [2021-12-22 00:05:12,413 INFO L387 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 [2021-12-22 00:05:12,493 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:12,493 INFO L387 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 [2021-12-22 00:05:12,496 INFO L387 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 [2021-12-22 00:05:12,527 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-22 00:05:12,527 INFO L387 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 [2021-12-22 00:05:12,647 INFO L387 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 [2021-12-22 00:05:12,650 INFO L387 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 [2021-12-22 00:05:12,747 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:05:12,747 INFO L387 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 [2021-12-22 00:05:12,750 INFO L387 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 [2021-12-22 00:05:13,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:13,020 INFO L387 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 [2021-12-22 00:05:13,023 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-22 00:05:13,023 INFO L387 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 [2021-12-22 00:05:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:05:13,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:05:13,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-22 00:05:13,764 INFO L387 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