./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0504.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0504.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:32:03,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:32:03,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:32:03,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:32:03,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:32:03,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:32:03,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:32:03,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:32:03,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:32:03,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:32:03,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:32:03,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:32:03,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:32:03,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:32:03,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:32:03,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:32:03,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:32:03,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:32:03,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:32:03,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:32:03,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:32:03,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:32:03,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:32:03,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:32:03,630 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:32:03,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:32:03,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:32:03,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:32:03,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:32:03,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:32:03,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:32:03,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:32:03,635 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:32:03,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:32:03,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:32:03,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:32:03,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:32:03,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:32:03,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:32:03,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:32:03,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:32:03,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:32:03,672 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:32:03,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:32:03,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:32:03,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:32:03,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:32:03,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:32:03,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:32:03,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:32:03,673 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:32:03,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:32:03,677 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:32:03,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:32:03,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:32:03,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:32:03,679 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:32:03,679 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:32:03,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:32:03,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:32:03,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:32:03,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:32:03,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:32:03,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:32:03,680 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:32:03,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:32:03,680 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:32:03,680 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 -> cddde357ab55a506b6049f3b60959cd723bf2cbfd36f7774fe3606d53024bbf3 [2021-12-18 20:32:03,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:32:03,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:32:03,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:32:03,908 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:32:03,908 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:32:03,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0504.i [2021-12-18 20:32:03,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7e3af8c/a851fad2342d416086c917ffd0837631/FLAG07a0b4313 [2021-12-18 20:32:04,329 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:32:04,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0504.i [2021-12-18 20:32:04,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7e3af8c/a851fad2342d416086c917ffd0837631/FLAG07a0b4313 [2021-12-18 20:32:04,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7e3af8c/a851fad2342d416086c917ffd0837631 [2021-12-18 20:32:04,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:32:04,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:32:04,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:32:04,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:32:04,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:32:04,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:04,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd9af57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04, skipping insertion in model container [2021-12-18 20:32:04,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:04,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:32:04,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:32:04,920 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:32:04,924 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:32:04,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:32:04,967 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:32:04,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04 WrapperNode [2021-12-18 20:32:04,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:32:04,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:32:04,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:32:04,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:32:04,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:04,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,010 INFO L137 Inliner]: procedures = 123, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 86 [2021-12-18 20:32:05,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:32:05,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:32:05,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:32:05,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:32:05,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:32:05,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:32:05,062 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:32:05,062 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:32:05,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (1/1) ... [2021-12-18 20:32:05,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:32:05,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:05,099 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-18 20:32:05,101 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-18 20:32:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 20:32:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:32:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:32:05,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:32:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:32:05,211 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:32:05,212 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:32:05,528 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:32:05,533 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:32:05,539 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-18 20:32:05,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:32:05 BoogieIcfgContainer [2021-12-18 20:32:05,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:32:05,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:32:05,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:32:05,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:32:05,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:32:04" (1/3) ... [2021-12-18 20:32:05,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38df173d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:32:05, skipping insertion in model container [2021-12-18 20:32:05,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:32:04" (2/3) ... [2021-12-18 20:32:05,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38df173d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:32:05, skipping insertion in model container [2021-12-18 20:32:05,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:32:05" (3/3) ... [2021-12-18 20:32:05,549 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0504.i [2021-12-18 20:32:05,552 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:32:05,553 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2021-12-18 20:32:05,580 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:32:05,586 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-18 20:32:05,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2021-12-18 20:32:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 20:32:05,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:05,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 20:32:05,601 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:05,604 INFO L85 PathProgramCache]: Analyzing trace with hash 28780379, now seen corresponding path program 1 times [2021-12-18 20:32:05,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:05,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895063449] [2021-12-18 20:32:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:05,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:05,708 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-18 20:32:05,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:05,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895063449] [2021-12-18 20:32:05,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895063449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:05,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:05,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:05,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849194687] [2021-12-18 20:32:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:05,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 20:32:05,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:05,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 20:32:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 20:32:05,739 INFO L87 Difference]: Start difference. First operand has 87 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:05,755 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2021-12-18 20:32:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 20:32:05,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 20:32:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:05,763 INFO L225 Difference]: With dead ends: 87 [2021-12-18 20:32:05,763 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 20:32:05,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 20:32:05,770 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:05,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:05,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 20:32:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2021-12-18 20:32:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 44 states have (on average 2.022727272727273) internal successors, (89), 84 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-12-18 20:32:05,808 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 5 [2021-12-18 20:32:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:05,808 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-12-18 20:32:05,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-12-18 20:32:05,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:32:05,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:05,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:32:05,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:32:05,810 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:05,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash 889572104, now seen corresponding path program 1 times [2021-12-18 20:32:05,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:05,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437190429] [2021-12-18 20:32:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:05,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:05,875 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-18 20:32:05,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:05,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437190429] [2021-12-18 20:32:05,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437190429] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:05,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:05,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:32:05,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941451535] [2021-12-18 20:32:05,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:05,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:05,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:05,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:05,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:05,879 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:05,918 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-18 20:32:05,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:05,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:32:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:05,922 INFO L225 Difference]: With dead ends: 133 [2021-12-18 20:32:05,922 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 20:32:05,923 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-18 20:32:05,926 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:05,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 165 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 20:32:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 109. [2021-12-18 20:32:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 108 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2021-12-18 20:32:05,942 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 6 [2021-12-18 20:32:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:05,942 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2021-12-18 20:32:05,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2021-12-18 20:32:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:32:05,943 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:05,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:32:05,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:32:05,945 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:05,946 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2021-12-18 20:32:05,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:05,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414484335] [2021-12-18 20:32:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:05,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:05,984 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-18 20:32:05,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:05,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414484335] [2021-12-18 20:32:05,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414484335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:05,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:05,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:05,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588476416] [2021-12-18 20:32:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:05,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:05,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:05,987 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,070 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2021-12-18 20:32:06,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:32:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,071 INFO L225 Difference]: With dead ends: 130 [2021-12-18 20:32:06,072 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 20:32:06,072 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-18 20:32:06,073 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 64 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:06,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 20:32:06,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 101. [2021-12-18 20:32:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.8235294117647058) internal successors, (124), 100 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2021-12-18 20:32:06,084 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 6 [2021-12-18 20:32:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,084 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2021-12-18 20:32:06,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2021-12-18 20:32:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:32:06,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:32:06,086 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2021-12-18 20:32:06,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009740401] [2021-12-18 20:32:06,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,140 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-18 20:32:06,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009740401] [2021-12-18 20:32:06,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009740401] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:06,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348299611] [2021-12-18 20:32:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:06,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:06,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:06,143 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,211 INFO L93 Difference]: Finished difference Result 138 states and 161 transitions. [2021-12-18 20:32:06,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:32:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,212 INFO L225 Difference]: With dead ends: 138 [2021-12-18 20:32:06,212 INFO L226 Difference]: Without dead ends: 138 [2021-12-18 20:32:06,213 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-18 20:32:06,213 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 47 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 102 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-18 20:32:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2021-12-18 20:32:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 100 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2021-12-18 20:32:06,219 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 6 [2021-12-18 20:32:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,219 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2021-12-18 20:32:06,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,219 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2021-12-18 20:32:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 20:32:06,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:32:06,220 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1806930847, now seen corresponding path program 1 times [2021-12-18 20:32:06,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736381187] [2021-12-18 20:32:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,239 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-18 20:32:06,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736381187] [2021-12-18 20:32:06,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736381187] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:06,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035188850] [2021-12-18 20:32:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:06,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:06,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:06,242 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,281 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2021-12-18 20:32:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 20:32:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,283 INFO L225 Difference]: With dead ends: 103 [2021-12-18 20:32:06,284 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 20:32:06,284 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-18 20:32:06,285 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 20:32:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-18 20:32:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.6805555555555556) internal successors, (121), 99 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2021-12-18 20:32:06,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 7 [2021-12-18 20:32:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,296 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2021-12-18 20:32:06,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2021-12-18 20:32:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:32:06,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:32:06,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1857997403, now seen corresponding path program 1 times [2021-12-18 20:32:06,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183495611] [2021-12-18 20:32:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,440 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-18 20:32:06,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183495611] [2021-12-18 20:32:06,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183495611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:32:06,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010586750] [2021-12-18 20:32:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:32:06,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:32:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:32:06,443 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,547 INFO L93 Difference]: Finished difference Result 126 states and 146 transitions. [2021-12-18 20:32:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:32:06,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:32:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,548 INFO L225 Difference]: With dead ends: 126 [2021-12-18 20:32:06,548 INFO L226 Difference]: Without dead ends: 126 [2021-12-18 20:32:06,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:32:06,549 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 154 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 68 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-18 20:32:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 92. [2021-12-18 20:32:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 91 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2021-12-18 20:32:06,552 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 15 [2021-12-18 20:32:06,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,552 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2021-12-18 20:32:06,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2021-12-18 20:32:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 20:32:06,553 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,553 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 20:32:06,553 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344638, now seen corresponding path program 1 times [2021-12-18 20:32:06,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615947501] [2021-12-18 20:32:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,581 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-18 20:32:06,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615947501] [2021-12-18 20:32:06,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615947501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:06,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674949952] [2021-12-18 20:32:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:06,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:06,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:06,583 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,617 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2021-12-18 20:32:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:06,618 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-18 20:32:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,619 INFO L225 Difference]: With dead ends: 88 [2021-12-18 20:32:06,619 INFO L226 Difference]: Without dead ends: 88 [2021-12-18 20:32:06,619 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-18 20:32:06,619 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-18 20:32:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-18 20:32:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 87 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2021-12-18 20:32:06,622 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 16 [2021-12-18 20:32:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,622 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2021-12-18 20:32:06,623 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-18 20:32:06,623 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2021-12-18 20:32:06,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 20:32:06,623 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 20:32:06,624 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1763344639, now seen corresponding path program 1 times [2021-12-18 20:32:06,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24156815] [2021-12-18 20:32:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,650 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-18 20:32:06,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24156815] [2021-12-18 20:32:06,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24156815] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:32:06,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989375404] [2021-12-18 20:32:06,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:32:06,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:32:06,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:32:06,652 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,677 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2021-12-18 20:32:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:32:06,677 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-18 20:32:06,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,678 INFO L225 Difference]: With dead ends: 84 [2021-12-18 20:32:06,678 INFO L226 Difference]: Without dead ends: 84 [2021-12-18 20:32:06,678 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-18 20:32:06,679 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 89 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-18 20:32:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-18 20:32:06,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 83 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2021-12-18 20:32:06,681 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2021-12-18 20:32:06,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,682 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2021-12-18 20:32:06,682 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-18 20:32:06,682 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2021-12-18 20:32:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 20:32:06,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,682 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 20:32:06,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864768, now seen corresponding path program 1 times [2021-12-18 20:32:06,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878961490] [2021-12-18 20:32:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:06,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878961490] [2021-12-18 20:32:06,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878961490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:32:06,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173852531] [2021-12-18 20:32:06,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:32:06,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:32:06,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:32:06,710 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,777 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-18 20:32:06,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:32:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 20:32:06,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,778 INFO L225 Difference]: With dead ends: 114 [2021-12-18 20:32:06,778 INFO L226 Difference]: Without dead ends: 114 [2021-12-18 20:32:06,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:06,779 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 84 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:06,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-18 20:32:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2021-12-18 20:32:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 85 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2021-12-18 20:32:06,781 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 18 [2021-12-18 20:32:06,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,782 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2021-12-18 20:32:06,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2021-12-18 20:32:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 20:32:06,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,782 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 20:32:06,783 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1967864767, now seen corresponding path program 1 times [2021-12-18 20:32:06,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126854460] [2021-12-18 20:32:06,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:06,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126854460] [2021-12-18 20:32:06,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126854460] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:32:06,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299289524] [2021-12-18 20:32:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:32:06,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:32:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:32:06,819 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,899 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2021-12-18 20:32:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:32:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 20:32:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,900 INFO L225 Difference]: With dead ends: 153 [2021-12-18 20:32:06,900 INFO L226 Difference]: Without dead ends: 153 [2021-12-18 20:32:06,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:06,901 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 72 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-18 20:32:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 109. [2021-12-18 20:32:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 108 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2021-12-18 20:32:06,904 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 18 [2021-12-18 20:32:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,904 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2021-12-18 20:32:06,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2021-12-18 20:32:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:32:06,905 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,905 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:06,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 20:32:06,905 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,906 INFO L85 PathProgramCache]: Analyzing trace with hash -874266265, now seen corresponding path program 1 times [2021-12-18 20:32:06,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295403522] [2021-12-18 20:32:06,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:06,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:06,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:06,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295403522] [2021-12-18 20:32:06,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295403522] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:06,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:06,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:32:06,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008760665] [2021-12-18 20:32:06,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:06,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:32:06,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:06,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:32:06,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:32:06,938 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:06,975 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-18 20:32:06,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:32:06,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:32:06,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:06,979 INFO L225 Difference]: With dead ends: 113 [2021-12-18 20:32:06,979 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 20:32:06,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:06,980 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:06,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:06,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 20:32:06,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2021-12-18 20:32:06,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 105 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2021-12-18 20:32:06,982 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 19 [2021-12-18 20:32:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:06,982 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2021-12-18 20:32:06,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2021-12-18 20:32:06,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:32:06,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:06,983 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-18 20:32:06,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 20:32:06,983 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash 55140128, now seen corresponding path program 1 times [2021-12-18 20:32:06,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866187837] [2021-12-18 20:32:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:06,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:07,019 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-18 20:32:07,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:07,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866187837] [2021-12-18 20:32:07,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866187837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:07,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:07,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:32:07,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894610434] [2021-12-18 20:32:07,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:07,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:32:07,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:07,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:32:07,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:32:07,021 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:07,114 INFO L93 Difference]: Finished difference Result 170 states and 187 transitions. [2021-12-18 20:32:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:32:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:32:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:07,116 INFO L225 Difference]: With dead ends: 170 [2021-12-18 20:32:07,116 INFO L226 Difference]: Without dead ends: 170 [2021-12-18 20:32:07,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:32:07,116 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:07,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-18 20:32:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2021-12-18 20:32:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 119 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2021-12-18 20:32:07,119 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 19 [2021-12-18 20:32:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:07,119 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2021-12-18 20:32:07,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2021-12-18 20:32:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:32:07,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:07,120 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-18 20:32:07,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 20:32:07,120 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:07,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:07,121 INFO L85 PathProgramCache]: Analyzing trace with hash 55140129, now seen corresponding path program 1 times [2021-12-18 20:32:07,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:07,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224648280] [2021-12-18 20:32:07,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:07,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:07,263 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-18 20:32:07,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:07,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224648280] [2021-12-18 20:32:07,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224648280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:07,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:07,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 20:32:07,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905869115] [2021-12-18 20:32:07,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:07,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:32:07,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:07,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:32:07,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:32:07,265 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-18 20:32:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:07,551 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-12-18 20:32:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:32:07,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-18 20:32:07,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:07,552 INFO L225 Difference]: With dead ends: 184 [2021-12-18 20:32:07,552 INFO L226 Difference]: Without dead ends: 184 [2021-12-18 20:32:07,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:32:07,553 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 179 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:07,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 199 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:32:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-18 20:32:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 120. [2021-12-18 20:32:07,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 103 states have (on average 1.2912621359223302) internal successors, (133), 119 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions. [2021-12-18 20:32:07,555 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 19 [2021-12-18 20:32:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:07,555 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 133 transitions. [2021-12-18 20:32:07,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 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-18 20:32:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions. [2021-12-18 20:32:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 20:32:07,556 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:07,556 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:07,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 20:32:07,556 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:07,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:07,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429407, now seen corresponding path program 1 times [2021-12-18 20:32:07,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:07,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257376086] [2021-12-18 20:32:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:07,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:32:07,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:07,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257376086] [2021-12-18 20:32:07,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257376086] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:07,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:07,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:32:07,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994721972] [2021-12-18 20:32:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:07,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:32:07,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:32:07,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:32:07,594 INFO L87 Difference]: Start difference. First operand 120 states and 133 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:07,641 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2021-12-18 20:32:07,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:32:07,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 20:32:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:07,642 INFO L225 Difference]: With dead ends: 135 [2021-12-18 20:32:07,642 INFO L226 Difference]: Without dead ends: 135 [2021-12-18 20:32:07,643 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-18 20:32:07,643 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:07,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-18 20:32:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2021-12-18 20:32:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 122 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 139 transitions. [2021-12-18 20:32:07,645 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 139 transitions. Word has length 20 [2021-12-18 20:32:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:07,646 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 139 transitions. [2021-12-18 20:32:07,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 139 transitions. [2021-12-18 20:32:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 20:32:07,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:07,647 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:07,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 20:32:07,647 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:07,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:07,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1332429406, now seen corresponding path program 1 times [2021-12-18 20:32:07,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:07,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231487410] [2021-12-18 20:32:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:07,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:07,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:07,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231487410] [2021-12-18 20:32:07,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231487410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:07,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:07,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:32:07,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300736659] [2021-12-18 20:32:07,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:07,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:32:07,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:32:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:07,687 INFO L87 Difference]: Start difference. First operand 123 states and 139 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:07,814 INFO L93 Difference]: Finished difference Result 194 states and 217 transitions. [2021-12-18 20:32:07,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:32:07,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 20:32:07,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:07,815 INFO L225 Difference]: With dead ends: 194 [2021-12-18 20:32:07,816 INFO L226 Difference]: Without dead ends: 194 [2021-12-18 20:32:07,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:07,816 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:07,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 132 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-18 20:32:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 135. [2021-12-18 20:32:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 134 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 158 transitions. [2021-12-18 20:32:07,819 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 158 transitions. Word has length 20 [2021-12-18 20:32:07,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:07,819 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 158 transitions. [2021-12-18 20:32:07,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 158 transitions. [2021-12-18 20:32:07,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:32:07,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:07,819 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] [2021-12-18 20:32:07,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 20:32:07,820 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:07,820 INFO L85 PathProgramCache]: Analyzing trace with hash -316635569, now seen corresponding path program 1 times [2021-12-18 20:32:07,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:07,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608265100] [2021-12-18 20:32:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:07,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:07,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:07,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608265100] [2021-12-18 20:32:07,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608265100] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:07,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:07,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:32:07,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855121539] [2021-12-18 20:32:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:07,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:32:07,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:32:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:32:07,886 INFO L87 Difference]: Start difference. First operand 135 states and 158 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:08,056 INFO L93 Difference]: Finished difference Result 195 states and 225 transitions. [2021-12-18 20:32:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:32:08,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:32:08,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:08,057 INFO L225 Difference]: With dead ends: 195 [2021-12-18 20:32:08,057 INFO L226 Difference]: Without dead ends: 195 [2021-12-18 20:32:08,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-12-18 20:32:08,058 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 93 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:08,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-18 20:32:08,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 143. [2021-12-18 20:32:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 127 states have (on average 1.31496062992126) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2021-12-18 20:32:08,061 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 23 [2021-12-18 20:32:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:08,061 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2021-12-18 20:32:08,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2021-12-18 20:32:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:32:08,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:08,065 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] [2021-12-18 20:32:08,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 20:32:08,065 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1225769432, now seen corresponding path program 1 times [2021-12-18 20:32:08,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:08,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803987598] [2021-12-18 20:32:08,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:08,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:08,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:08,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803987598] [2021-12-18 20:32:08,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803987598] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:08,111 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:08,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:32:08,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931567789] [2021-12-18 20:32:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:08,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:32:08,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:08,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:32:08,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:08,113 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:08,189 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2021-12-18 20:32:08,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:32:08,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:32:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:08,191 INFO L225 Difference]: With dead ends: 167 [2021-12-18 20:32:08,191 INFO L226 Difference]: Without dead ends: 167 [2021-12-18 20:32:08,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:08,191 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:08,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-18 20:32:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2021-12-18 20:32:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 156 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 191 transitions. [2021-12-18 20:32:08,194 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 191 transitions. Word has length 24 [2021-12-18 20:32:08,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:08,195 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 191 transitions. [2021-12-18 20:32:08,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:08,195 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 191 transitions. [2021-12-18 20:32:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 20:32:08,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:08,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:08,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 20:32:08,195 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1085033438, now seen corresponding path program 1 times [2021-12-18 20:32:08,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914620461] [2021-12-18 20:32:08,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:08,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:08,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914620461] [2021-12-18 20:32:08,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914620461] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:08,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186705413] [2021-12-18 20:32:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:08,295 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:08,296 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-18 20:32:08,310 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-18 20:32:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:08,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-18 20:32:08,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:08,441 INFO L388 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-18 20:32:08,445 INFO L388 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-18 20:32:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,529 INFO L388 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-18 20:32:08,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,534 INFO L388 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-18 20:32:08,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:08,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:08,651 INFO L388 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 15 treesize of output 7 [2021-12-18 20:32:08,653 INFO L388 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 15 treesize of output 7 [2021-12-18 20:32:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:08,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:08,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186705413] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:08,867 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:08,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 9 [2021-12-18 20:32:08,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235884361] [2021-12-18 20:32:08,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:08,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:32:08,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:32:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:32:08,869 INFO L87 Difference]: Start difference. First operand 157 states and 191 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:09,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:09,034 INFO L93 Difference]: Finished difference Result 186 states and 218 transitions. [2021-12-18 20:32:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:32:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 20:32:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:09,035 INFO L225 Difference]: With dead ends: 186 [2021-12-18 20:32:09,036 INFO L226 Difference]: Without dead ends: 186 [2021-12-18 20:32:09,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:32:09,036 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 183 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:09,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 266 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-12-18 20:32:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 161. [2021-12-18 20:32:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 145 states have (on average 1.3448275862068966) internal successors, (195), 160 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 195 transitions. [2021-12-18 20:32:09,039 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 195 transitions. Word has length 27 [2021-12-18 20:32:09,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:09,039 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 195 transitions. [2021-12-18 20:32:09,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 195 transitions. [2021-12-18 20:32:09,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 20:32:09,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:09,040 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-18 20:32:09,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 20:32:09,255 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,SelfDestructingSolverStorable17 [2021-12-18 20:32:09,255 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:09,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846143, now seen corresponding path program 1 times [2021-12-18 20:32:09,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:09,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123234686] [2021-12-18 20:32:09,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:09,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:09,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:09,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123234686] [2021-12-18 20:32:09,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123234686] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:09,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550886837] [2021-12-18 20:32:09,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:09,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:09,340 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-18 20:32:09,341 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-18 20:32:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:09,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 20:32:09,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:09,439 INFO L388 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-18 20:32:09,472 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:32:09,472 INFO L388 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-18 20:32:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:09,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:09,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550886837] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:09,621 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:09,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-18 20:32:09,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29801018] [2021-12-18 20:32:09,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:09,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:32:09,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:09,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:32:09,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:32:09,622 INFO L87 Difference]: Start difference. First operand 161 states and 195 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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-18 20:32:09,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:09,685 INFO L93 Difference]: Finished difference Result 181 states and 214 transitions. [2021-12-18 20:32:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:32:09,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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-18 20:32:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:09,686 INFO L225 Difference]: With dead ends: 181 [2021-12-18 20:32:09,686 INFO L226 Difference]: Without dead ends: 181 [2021-12-18 20:32:09,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:09,687 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 175 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:09,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 141 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-18 20:32:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-18 20:32:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 160. [2021-12-18 20:32:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 159 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:09,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 193 transitions. [2021-12-18 20:32:09,689 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 193 transitions. Word has length 27 [2021-12-18 20:32:09,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:09,689 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 193 transitions. [2021-12-18 20:32:09,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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-18 20:32:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 193 transitions. [2021-12-18 20:32:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 20:32:09,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:09,690 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-12-18 20:32:09,708 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-18 20:32:09,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:09,906 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:09,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2078846144, now seen corresponding path program 1 times [2021-12-18 20:32:09,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:09,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537922548] [2021-12-18 20:32:09,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:09,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:09,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:09,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537922548] [2021-12-18 20:32:09,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537922548] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:09,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881704139] [2021-12-18 20:32:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:09,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:09,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:09,971 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-18 20:32:09,972 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-18 20:32:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:10,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:32:10,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:10,079 INFO L388 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-18 20:32:10,087 INFO L388 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-18 20:32:10,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:10,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 20:32:10,167 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:10,167 INFO L388 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-18 20:32:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:10,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:10,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881704139] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:10,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:10,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-18 20:32:10,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383797686] [2021-12-18 20:32:10,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:10,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 20:32:10,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 20:32:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:32:10,520 INFO L87 Difference]: Start difference. First operand 160 states and 193 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 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-18 20:32:10,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:10,644 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2021-12-18 20:32:10,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:32:10,644 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 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 27 [2021-12-18 20:32:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:10,645 INFO L225 Difference]: With dead ends: 247 [2021-12-18 20:32:10,645 INFO L226 Difference]: Without dead ends: 247 [2021-12-18 20:32:10,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:32:10,645 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:10,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 200 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2021-12-18 20:32:10,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-18 20:32:10,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 192. [2021-12-18 20:32:10,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 177 states have (on average 1.2937853107344632) internal successors, (229), 191 states have internal predecessors, (229), 0 states have call successors, (0), 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-18 20:32:10,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2021-12-18 20:32:10,648 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 27 [2021-12-18 20:32:10,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:10,648 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2021-12-18 20:32:10,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 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-18 20:32:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2021-12-18 20:32:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:32:10,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:10,648 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] [2021-12-18 20:32:10,667 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-18 20:32:10,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:10,851 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash 723701189, now seen corresponding path program 1 times [2021-12-18 20:32:10,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:10,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379214788] [2021-12-18 20:32:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:10,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:10,901 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-18 20:32:10,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:10,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379214788] [2021-12-18 20:32:10,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379214788] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:10,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119239341] [2021-12-18 20:32:10,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:10,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:10,903 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-18 20:32:10,908 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-18 20:32:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:10,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 20:32:10,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:11,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-18 20:32:11,107 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-18 20:32:11,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:11,214 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-18 20:32:11,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119239341] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:11,214 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:11,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 7 [2021-12-18 20:32:11,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676982870] [2021-12-18 20:32:11,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:11,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:32:11,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:11,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:32:11,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:11,215 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:11,376 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2021-12-18 20:32:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:32:11,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:32:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:11,378 INFO L225 Difference]: With dead ends: 194 [2021-12-18 20:32:11,378 INFO L226 Difference]: Without dead ends: 182 [2021-12-18 20:32:11,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-12-18 20:32:11,378 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:11,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 230 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 88 Unchecked, 0.1s Time] [2021-12-18 20:32:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-18 20:32:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-18 20:32:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 181 states have internal predecessors, (218), 0 states have call successors, (0), 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-18 20:32:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 218 transitions. [2021-12-18 20:32:11,381 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 218 transitions. Word has length 28 [2021-12-18 20:32:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:11,381 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 218 transitions. [2021-12-18 20:32:11,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 218 transitions. [2021-12-18 20:32:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 20:32:11,382 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:11,382 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:11,411 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-18 20:32:11,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:11,599 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -28804244, now seen corresponding path program 1 times [2021-12-18 20:32:11,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:11,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507515322] [2021-12-18 20:32:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:11,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:11,742 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-18 20:32:11,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507515322] [2021-12-18 20:32:11,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507515322] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:11,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992210691] [2021-12-18 20:32:11,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:11,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:11,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:11,744 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-18 20:32:11,745 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-18 20:32:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:11,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 20:32:11,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:11,852 INFO L388 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-18 20:32:11,857 INFO L388 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-18 20:32:11,882 INFO L388 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-18 20:32:11,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:11,896 INFO L388 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-18 20:32:11,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:11,909 INFO L388 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-18 20:32:11,938 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:11,939 INFO L388 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-18 20:32:11,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:32:11,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-12-18 20:32:12,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:32:12,111 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-18 20:32:12,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:12,359 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-18 20:32:12,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992210691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:12,359 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:12,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 4] total 17 [2021-12-18 20:32:12,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069829232] [2021-12-18 20:32:12,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:12,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 20:32:12,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:12,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 20:32:12,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-18 20:32:12,360 INFO L87 Difference]: Start difference. First operand 182 states and 218 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 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-18 20:32:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:12,728 INFO L93 Difference]: Finished difference Result 307 states and 363 transitions. [2021-12-18 20:32:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:32:12,730 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 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 31 [2021-12-18 20:32:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:12,731 INFO L225 Difference]: With dead ends: 307 [2021-12-18 20:32:12,731 INFO L226 Difference]: Without dead ends: 307 [2021-12-18 20:32:12,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2021-12-18 20:32:12,732 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 431 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:12,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 397 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 472 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2021-12-18 20:32:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-18 20:32:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 212. [2021-12-18 20:32:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 197 states have (on average 1.284263959390863) internal successors, (253), 211 states have internal predecessors, (253), 0 states have call successors, (0), 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-18 20:32:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 253 transitions. [2021-12-18 20:32:12,741 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 253 transitions. Word has length 31 [2021-12-18 20:32:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:12,741 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 253 transitions. [2021-12-18 20:32:12,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 18 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-18 20:32:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 253 transitions. [2021-12-18 20:32:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:32:12,741 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:12,741 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, 1, 1, 1, 1] [2021-12-18 20:32:12,761 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-18 20:32:12,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-18 20:32:12,951 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:12,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 36474197, now seen corresponding path program 1 times [2021-12-18 20:32:12,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:12,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962828326] [2021-12-18 20:32:12,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:12,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:13,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:13,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962828326] [2021-12-18 20:32:13,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962828326] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:13,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006911215] [2021-12-18 20:32:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:13,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:13,053 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-18 20:32:13,054 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-18 20:32:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:13,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 20:32:13,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:13,184 INFO L388 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-18 20:32:13,201 INFO L388 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-18 20:32:13,217 INFO L354 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2021-12-18 20:32:13,217 INFO L388 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 21 treesize of output 29 [2021-12-18 20:32:13,252 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 20:32:13,252 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-18 20:32:13,275 INFO L388 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 25 treesize of output 13 [2021-12-18 20:32:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:13,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:13,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006911215] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:13,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:13,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-18 20:32:13,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544510984] [2021-12-18 20:32:13,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:13,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 20:32:13,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:13,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 20:32:13,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:32:13,414 INFO L87 Difference]: Start difference. First operand 212 states and 253 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:13,564 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2021-12-18 20:32:13,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:32:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:32:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:13,565 INFO L225 Difference]: With dead ends: 230 [2021-12-18 20:32:13,565 INFO L226 Difference]: Without dead ends: 230 [2021-12-18 20:32:13,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2021-12-18 20:32:13,566 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 67 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:13,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 317 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 167 Invalid, 0 Unknown, 97 Unchecked, 0.1s Time] [2021-12-18 20:32:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-12-18 20:32:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 211. [2021-12-18 20:32:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.2741116751269035) internal successors, (251), 210 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 251 transitions. [2021-12-18 20:32:13,569 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 251 transitions. Word has length 32 [2021-12-18 20:32:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:13,569 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 251 transitions. [2021-12-18 20:32:13,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 251 transitions. [2021-12-18 20:32:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:32:13,570 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:13,570 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, 1, 1, 1, 1] [2021-12-18 20:32:13,590 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-18 20:32:13,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:13,783 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:13,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash 36474198, now seen corresponding path program 1 times [2021-12-18 20:32:13,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:13,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503310003] [2021-12-18 20:32:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:13,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:13,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:13,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503310003] [2021-12-18 20:32:13,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503310003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831476674] [2021-12-18 20:32:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:13,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:13,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:13,870 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-18 20:32:13,871 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-18 20:32:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:13,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-18 20:32:14,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:14,017 INFO L388 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-18 20:32:14,021 INFO L388 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-18 20:32:14,071 INFO L388 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-18 20:32:14,075 INFO L388 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-18 20:32:14,102 INFO L354 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-18 20:32:14,102 INFO L388 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 15 treesize of output 15 [2021-12-18 20:32:14,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:32:14,159 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 20:32:14,159 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-18 20:32:14,168 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 20:32:14,168 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2021-12-18 20:32:14,214 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:32:14,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-18 20:32:14,218 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:32:14,218 INFO L388 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 36 treesize of output 16 [2021-12-18 20:32:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:14,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:14,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831476674] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:14,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:14,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2021-12-18 20:32:14,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262304526] [2021-12-18 20:32:14,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:14,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 20:32:14,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:14,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 20:32:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2021-12-18 20:32:14,561 INFO L87 Difference]: Start difference. First operand 211 states and 251 transitions. Second operand has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:14,914 INFO L93 Difference]: Finished difference Result 276 states and 328 transitions. [2021-12-18 20:32:14,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:32:14,914 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:32:14,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:14,915 INFO L225 Difference]: With dead ends: 276 [2021-12-18 20:32:14,915 INFO L226 Difference]: Without dead ends: 276 [2021-12-18 20:32:14,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2021-12-18 20:32:14,916 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 146 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:14,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 471 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2021-12-18 20:32:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2021-12-18 20:32:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 210. [2021-12-18 20:32:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.263959390862944) internal successors, (249), 209 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 249 transitions. [2021-12-18 20:32:14,918 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 249 transitions. Word has length 32 [2021-12-18 20:32:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:14,919 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 249 transitions. [2021-12-18 20:32:14,919 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.0) internal successors, (72), 19 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 249 transitions. [2021-12-18 20:32:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 20:32:14,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:14,919 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:14,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:15,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:15,131 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1911073267, now seen corresponding path program 1 times [2021-12-18 20:32:15,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:15,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567839863] [2021-12-18 20:32:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:15,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:15,225 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-18 20:32:15,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:15,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567839863] [2021-12-18 20:32:15,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567839863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:15,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330246581] [2021-12-18 20:32:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:15,226 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:15,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:15,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 20:32:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:15,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 20:32:15,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:15,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:32:15,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:32:15,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330246581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:15,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:32:15,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2021-12-18 20:32:15,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729730019] [2021-12-18 20:32:15,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:15,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:32:15,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:15,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:32:15,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-18 20:32:15,415 INFO L87 Difference]: Start difference. First operand 210 states and 249 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:15,517 INFO L93 Difference]: Finished difference Result 224 states and 255 transitions. [2021-12-18 20:32:15,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:32:15,517 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-18 20:32:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:15,518 INFO L225 Difference]: With dead ends: 224 [2021-12-18 20:32:15,518 INFO L226 Difference]: Without dead ends: 224 [2021-12-18 20:32:15,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2021-12-18 20:32:15,518 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:15,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-18 20:32:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 210. [2021-12-18 20:32:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 197 states have (on average 1.2588832487309645) internal successors, (248), 209 states have internal predecessors, (248), 0 states have call successors, (0), 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-18 20:32:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 248 transitions. [2021-12-18 20:32:15,521 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 248 transitions. Word has length 33 [2021-12-18 20:32:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:15,521 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 248 transitions. [2021-12-18 20:32:15,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 248 transitions. [2021-12-18 20:32:15,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:32:15,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:15,522 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:15,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:15,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-18 20:32:15,722 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:15,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827474, now seen corresponding path program 1 times [2021-12-18 20:32:15,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:15,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15981151] [2021-12-18 20:32:15,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:15,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:32:15,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:15,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15981151] [2021-12-18 20:32:15,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15981151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:15,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:15,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:32:15,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503974065] [2021-12-18 20:32:15,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:15,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:32:15,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:32:15,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:32:15,766 INFO L87 Difference]: Start difference. First operand 210 states and 248 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:15,813 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2021-12-18 20:32:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:32:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 20:32:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:15,814 INFO L225 Difference]: With dead ends: 216 [2021-12-18 20:32:15,814 INFO L226 Difference]: Without dead ends: 216 [2021-12-18 20:32:15,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:15,815 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 106 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:15,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 99 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-18 20:32:15,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 181. [2021-12-18 20:32:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 168 states have (on average 1.2380952380952381) internal successors, (208), 180 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:15,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 208 transitions. [2021-12-18 20:32:15,821 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 208 transitions. Word has length 36 [2021-12-18 20:32:15,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:15,821 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 208 transitions. [2021-12-18 20:32:15,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 208 transitions. [2021-12-18 20:32:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:32:15,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:15,822 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:15,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-18 20:32:15,822 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:15,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827524, now seen corresponding path program 1 times [2021-12-18 20:32:15,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:15,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978968326] [2021-12-18 20:32:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:15,823 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:15,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:15,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978968326] [2021-12-18 20:32:15,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978968326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:15,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:15,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:32:15,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924316939] [2021-12-18 20:32:15,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:15,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:32:15,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:32:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:15,866 INFO L87 Difference]: Start difference. First operand 181 states and 208 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:16,012 INFO L93 Difference]: Finished difference Result 215 states and 243 transitions. [2021-12-18 20:32:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:32:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 20:32:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:16,013 INFO L225 Difference]: With dead ends: 215 [2021-12-18 20:32:16,013 INFO L226 Difference]: Without dead ends: 215 [2021-12-18 20:32:16,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:32:16,014 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 70 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:16,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 177 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:16,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-18 20:32:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2021-12-18 20:32:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2429378531073447) internal successors, (220), 189 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 220 transitions. [2021-12-18 20:32:16,017 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 220 transitions. Word has length 36 [2021-12-18 20:32:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:16,017 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 220 transitions. [2021-12-18 20:32:16,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 220 transitions. [2021-12-18 20:32:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 20:32:16,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:16,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:16,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-18 20:32:16,017 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:16,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:16,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1302827525, now seen corresponding path program 1 times [2021-12-18 20:32:16,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:16,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38616859] [2021-12-18 20:32:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:16,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:16,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:16,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:16,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38616859] [2021-12-18 20:32:16,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38616859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:16,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:16,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:32:16,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210953097] [2021-12-18 20:32:16,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:16,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:32:16,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:16,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:32:16,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:32:16,091 INFO L87 Difference]: Start difference. First operand 190 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:16,300 INFO L93 Difference]: Finished difference Result 259 states and 293 transitions. [2021-12-18 20:32:16,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:32:16,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 20:32:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:16,301 INFO L225 Difference]: With dead ends: 259 [2021-12-18 20:32:16,301 INFO L226 Difference]: Without dead ends: 259 [2021-12-18 20:32:16,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:32:16,302 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:16,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 249 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-18 20:32:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 190. [2021-12-18 20:32:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 177 states have (on average 1.2372881355932204) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2021-12-18 20:32:16,306 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 36 [2021-12-18 20:32:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:16,306 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2021-12-18 20:32:16,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2021-12-18 20:32:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 20:32:16,306 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:16,306 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:16,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-18 20:32:16,306 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:16,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash 904979977, now seen corresponding path program 1 times [2021-12-18 20:32:16,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:16,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050520924] [2021-12-18 20:32:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:16,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:16,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050520924] [2021-12-18 20:32:16,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050520924] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:16,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680036016] [2021-12-18 20:32:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:16,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:16,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:16,547 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:16,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 20:32:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:16,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 20:32:16,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:16,708 INFO L388 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-18 20:32:16,724 INFO L388 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-18 20:32:16,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:16,744 INFO L388 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-18 20:32:16,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:16,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:16,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:16,775 INFO L388 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-18 20:32:16,875 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:32:16,875 INFO L388 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-18 20:32:16,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:32:16,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:32:16,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:32:17,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:32:17,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-18 20:32:17,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:17,126 INFO L354 Elim1Store]: treesize reduction 34, result has 46.0 percent of original size [2021-12-18 20:32:17,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 44 [2021-12-18 20:32:17,191 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:32:17,192 INFO L388 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 59 [2021-12-18 20:32:17,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:17,501 INFO L388 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 2 case distinctions, treesize of input 55 treesize of output 51 [2021-12-18 20:32:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:17,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:19,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int))) (= 1 (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1758) |c_ULTIMATE.start_main_~first~0#1.base|) |c_ULTIMATE.start_main_~first~0#1.offset|)))) is different from false [2021-12-18 20:32:20,221 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-18 20:32:20,221 INFO L388 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 2 case distinctions, treesize of input 57 treesize of output 50 [2021-12-18 20:32:20,227 INFO L388 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 90 treesize of output 86 [2021-12-18 20:32:20,231 INFO L388 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 55 treesize of output 51 [2021-12-18 20:32:20,236 INFO L388 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 47 treesize of output 45 [2021-12-18 20:32:20,246 INFO L388 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 78 treesize of output 74 [2021-12-18 20:32:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:22,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680036016] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:22,329 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:22,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 32 [2021-12-18 20:32:22,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038311695] [2021-12-18 20:32:22,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:22,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 20:32:22,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:22,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 20:32:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=821, Unknown=7, NotChecked=58, Total=992 [2021-12-18 20:32:22,335 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:23,033 INFO L93 Difference]: Finished difference Result 239 states and 274 transitions. [2021-12-18 20:32:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 20:32:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-18 20:32:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:23,035 INFO L225 Difference]: With dead ends: 239 [2021-12-18 20:32:23,035 INFO L226 Difference]: Without dead ends: 239 [2021-12-18 20:32:23,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=278, Invalid=1699, Unknown=7, NotChecked=86, Total=2070 [2021-12-18 20:32:23,036 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 70 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:23,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 655 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 269 Invalid, 0 Unknown, 395 Unchecked, 0.2s Time] [2021-12-18 20:32:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-18 20:32:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-18 20:32:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 220 states have (on average 1.2181818181818183) internal successors, (268), 232 states have internal predecessors, (268), 0 states have call successors, (0), 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-18 20:32:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2021-12-18 20:32:23,043 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 38 [2021-12-18 20:32:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:23,043 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2021-12-18 20:32:23,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.34375) internal successors, (107), 32 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2021-12-18 20:32:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-18 20:32:23,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:23,044 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:23,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:23,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-12-18 20:32:23,251 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2113196924, now seen corresponding path program 1 times [2021-12-18 20:32:23,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131260749] [2021-12-18 20:32:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:23,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:23,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:23,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131260749] [2021-12-18 20:32:23,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131260749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:23,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:23,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 20:32:23,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047671212] [2021-12-18 20:32:23,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:23,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:32:23,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:32:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:32:23,316 INFO L87 Difference]: Start difference. First operand 233 states and 268 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:23,578 INFO L93 Difference]: Finished difference Result 341 states and 383 transitions. [2021-12-18 20:32:23,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:32:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-18 20:32:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:23,580 INFO L225 Difference]: With dead ends: 341 [2021-12-18 20:32:23,580 INFO L226 Difference]: Without dead ends: 341 [2021-12-18 20:32:23,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2021-12-18 20:32:23,581 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:23,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 424 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:32:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-18 20:32:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 235. [2021-12-18 20:32:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 234 states have internal predecessors, (270), 0 states have call successors, (0), 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-18 20:32:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2021-12-18 20:32:23,584 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 38 [2021-12-18 20:32:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:23,584 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2021-12-18 20:32:23,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2021-12-18 20:32:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 20:32:23,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:23,585 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:23,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-18 20:32:23,585 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:23,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:23,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1084595048, now seen corresponding path program 1 times [2021-12-18 20:32:23,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:23,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825296610] [2021-12-18 20:32:23,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:23,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:23,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:23,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825296610] [2021-12-18 20:32:23,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825296610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:23,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:23,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 20:32:23,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086180886] [2021-12-18 20:32:23,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:23,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 20:32:23,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 20:32:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:32:23,672 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:23,946 INFO L93 Difference]: Finished difference Result 340 states and 382 transitions. [2021-12-18 20:32:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:32:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-18 20:32:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:23,948 INFO L225 Difference]: With dead ends: 340 [2021-12-18 20:32:23,948 INFO L226 Difference]: Without dead ends: 340 [2021-12-18 20:32:23,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-12-18 20:32:23,948 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:23,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 355 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:32:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-12-18 20:32:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 236. [2021-12-18 20:32:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 235 states have internal predecessors, (271), 0 states have call successors, (0), 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-18 20:32:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 271 transitions. [2021-12-18 20:32:23,952 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 271 transitions. Word has length 39 [2021-12-18 20:32:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:23,952 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 271 transitions. [2021-12-18 20:32:23,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 271 transitions. [2021-12-18 20:32:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 20:32:23,952 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:23,952 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:23,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-18 20:32:23,952 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:23,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1467279643, now seen corresponding path program 1 times [2021-12-18 20:32:23,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:23,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665413374] [2021-12-18 20:32:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:23,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:24,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665413374] [2021-12-18 20:32:24,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665413374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:24,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637759161] [2021-12-18 20:32:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:24,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:24,035 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:24,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 20:32:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:24,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:32:24,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:24,205 INFO L388 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-18 20:32:24,207 INFO L388 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-18 20:32:24,286 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:32:24,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-18 20:32:24,305 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:32:24,305 INFO L388 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-18 20:32:24,347 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:24,379 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:32:24,379 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:32:24,392 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:32:24,392 INFO L388 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:32:24,436 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:24,436 INFO L388 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-18 20:32:24,440 INFO L388 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 12 treesize of output 14 [2021-12-18 20:32:24,504 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 20:32:24,504 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-18 20:32:24,546 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:32:24,546 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2021-12-18 20:32:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:24,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:25,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:25,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637759161] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:25,087 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:25,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 4] total 16 [2021-12-18 20:32:25,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317023007] [2021-12-18 20:32:25,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:25,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 20:32:25,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:25,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 20:32:25,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-18 20:32:25,089 INFO L87 Difference]: Start difference. First operand 236 states and 271 transitions. Second operand has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:25,403 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2021-12-18 20:32:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:32:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-18 20:32:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:25,405 INFO L225 Difference]: With dead ends: 252 [2021-12-18 20:32:25,405 INFO L226 Difference]: Without dead ends: 252 [2021-12-18 20:32:25,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-18 20:32:25,405 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 379 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:25,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 254 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 155 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2021-12-18 20:32:25,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-12-18 20:32:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 194. [2021-12-18 20:32:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 193 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2021-12-18 20:32:25,408 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 40 [2021-12-18 20:32:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:25,408 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2021-12-18 20:32:25,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.125) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:25,408 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2021-12-18 20:32:25,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 20:32:25,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:25,409 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:25,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:25,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-18 20:32:25,622 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:25,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash 693362007, now seen corresponding path program 1 times [2021-12-18 20:32:25,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:25,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775675031] [2021-12-18 20:32:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:25,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:25,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775675031] [2021-12-18 20:32:25,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775675031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:25,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075727803] [2021-12-18 20:32:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:25,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:25,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:25,673 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:25,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 20:32:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:25,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 20:32:25,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:25,839 INFO L388 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-18 20:32:25,875 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:25,876 INFO L388 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-18 20:32:25,921 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:25,980 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:25,981 INFO L388 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 16 treesize of output 16 [2021-12-18 20:32:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:26,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:26,128 INFO L388 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 11 treesize of output 9 [2021-12-18 20:32:26,131 INFO L388 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 20 treesize of output 18 [2021-12-18 20:32:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:26,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075727803] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:26,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:26,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-18 20:32:26,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273383173] [2021-12-18 20:32:26,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:26,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 20:32:26,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:26,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 20:32:26,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2021-12-18 20:32:26,277 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:26,811 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2021-12-18 20:32:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:32:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-18 20:32:26,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:26,812 INFO L225 Difference]: With dead ends: 275 [2021-12-18 20:32:26,812 INFO L226 Difference]: Without dead ends: 275 [2021-12-18 20:32:26,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2021-12-18 20:32:26,813 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 302 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:26,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 680 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 785 Invalid, 0 Unknown, 23 Unchecked, 0.3s Time] [2021-12-18 20:32:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-12-18 20:32:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 194. [2021-12-18 20:32:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 181 states have (on average 1.2209944751381216) internal successors, (221), 193 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2021-12-18 20:32:26,816 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 40 [2021-12-18 20:32:26,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:26,816 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2021-12-18 20:32:26,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2021-12-18 20:32:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-18 20:32:26,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:26,816 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:26,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:27,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-18 20:32:27,033 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:27,034 INFO L85 PathProgramCache]: Analyzing trace with hash 737292038, now seen corresponding path program 1 times [2021-12-18 20:32:27,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:27,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611012331] [2021-12-18 20:32:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:27,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 20:32:27,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:27,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611012331] [2021-12-18 20:32:27,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611012331] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:32:27,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:32:27,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:32:27,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725643098] [2021-12-18 20:32:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:32:27,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:32:27,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:27,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:32:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:32:27,062 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:27,103 INFO L93 Difference]: Finished difference Result 193 states and 219 transitions. [2021-12-18 20:32:27,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:32:27,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-18 20:32:27,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:27,104 INFO L225 Difference]: With dead ends: 193 [2021-12-18 20:32:27,104 INFO L226 Difference]: Without dead ends: 193 [2021-12-18 20:32:27,104 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-18 20:32:27,105 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:27,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 106 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:32:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-18 20:32:27,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2021-12-18 20:32:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 181 states have (on average 1.2099447513812154) internal successors, (219), 192 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2021-12-18 20:32:27,107 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 40 [2021-12-18 20:32:27,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:27,107 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2021-12-18 20:32:27,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2021-12-18 20:32:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 20:32:27,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:27,108 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:27,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-18 20:32:27,108 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:27,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:27,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179932, now seen corresponding path program 1 times [2021-12-18 20:32:27,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:27,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932427307] [2021-12-18 20:32:27,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:27,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:27,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932427307] [2021-12-18 20:32:27,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932427307] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:27,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375929304] [2021-12-18 20:32:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:27,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:27,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:27,295 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:27,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 20:32:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:27,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-18 20:32:27,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:27,482 INFO L388 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-18 20:32:27,493 INFO L388 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-18 20:32:27,497 INFO L388 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-18 20:32:27,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,540 INFO L388 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-18 20:32:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,545 INFO L388 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-18 20:32:27,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:27,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:27,658 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:32:27,658 INFO L388 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-18 20:32:27,703 INFO L388 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-18 20:32:27,713 INFO L388 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-18 20:32:27,733 INFO L388 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-18 20:32:27,736 INFO L388 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-18 20:32:27,758 INFO L388 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-18 20:32:27,762 INFO L388 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-18 20:32:27,788 INFO L388 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-18 20:32:27,795 INFO L388 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-18 20:32:27,809 INFO L388 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-18 20:32:27,813 INFO L388 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-18 20:32:27,889 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-18 20:32:27,890 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 20:32:27,906 INFO L354 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-18 20:32:27,906 INFO L388 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 20:32:27,973 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:32:27,973 INFO L388 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 59 treesize of output 56 [2021-12-18 20:32:27,976 INFO L388 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-18 20:32:28,246 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:28,247 INFO L388 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 40 treesize of output 30 [2021-12-18 20:32:28,249 INFO L388 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 11 [2021-12-18 20:32:28,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:32:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:28,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:28,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)))))) is different from false [2021-12-18 20:32:28,755 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse0 0) (forall ((v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1)))) is different from false [2021-12-18 20:32:28,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (and (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0)) (= .cse0 0))))) is different from false [2021-12-18 20:32:29,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) is different from false [2021-12-18 20:32:29,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse1 0)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse1) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) is different from false [2021-12-18 20:32:29,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) is different from false [2021-12-18 20:32:29,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2462 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse1 0)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse1) 1)))) is different from false [2021-12-18 20:32:29,970 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse0 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse0) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|))) (and (forall ((v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse1 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse1 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse0 0))))) is different from false [2021-12-18 20:32:30,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2461 Int) (v_ArrVal_2460 Int) (v_ArrVal_2482 Int) (v_ArrVal_2452 Int) (v_ArrVal_2454 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (select (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2452) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2454) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2460) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2461)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2450 Int) (v_ArrVal_2462 Int) (v_ArrVal_2453 Int) (v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2458 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_2450) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_2453) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_2458) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_2462)) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse1 0)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse1) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) is different from false [2021-12-18 20:32:30,171 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-18 20:32:30,171 INFO L388 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 5 case distinctions, treesize of input 262 treesize of output 198 [2021-12-18 20:32:30,222 INFO L354 Elim1Store]: treesize reduction 320, result has 13.3 percent of original size [2021-12-18 20:32:30,223 INFO L388 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 5 case distinctions, treesize of input 198 treesize of output 190 [2021-12-18 20:32:30,226 INFO L388 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 232 treesize of output 220 [2021-12-18 20:32:30,234 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-18 20:32:30,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 236 treesize of output 214 [2021-12-18 20:32:30,242 INFO L388 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 321 treesize of output 307 [2021-12-18 20:32:30,247 INFO L388 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 347 treesize of output 339 [2021-12-18 20:32:30,251 INFO L388 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 339 treesize of output 323 [2021-12-18 20:32:30,259 INFO L354 Elim1Store]: treesize reduction 112, result has 0.9 percent of original size [2021-12-18 20:32:30,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 363 treesize of output 337 [2021-12-18 20:32:30,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2021-12-18 20:32:30,280 INFO L388 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 137 treesize of output 129 [2021-12-18 20:32:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-18 20:32:30,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375929304] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:30,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:30,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 37 [2021-12-18 20:32:30,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761045042] [2021-12-18 20:32:30,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:30,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 20:32:30,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 20:32:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=704, Unknown=9, NotChecked=558, Total=1406 [2021-12-18 20:32:30,590 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:33,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (= 1 .cse2) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse3 0) (forall ((v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse3) 1)))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse2 1) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse5 0)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse5) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-18 20:32:35,115 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (= 1 .cse2) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse3 0) (forall ((v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse3) 1)))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= .cse2 1) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.base_45| Int) (v_ArrVal_2474 (Array Int Int)) (v_ArrVal_2481 (Array Int Int))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2474))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |v_ULTIMATE.start_main_~x~0#1.base_45|))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2481) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)))) (or (and (forall ((v_ArrVal_2475 (Array Int Int)) (v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2475))) (store .cse4 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477))) |v_ULTIMATE.start_main_~x~0#1.base_45| v_ArrVal_2480) |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) 0)) (= .cse5 0)) (= (select (store (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45| 1) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2482) .cse5) 1) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_45|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-18 20:32:37,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (= |c_ULTIMATE.start_main_~first~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_main_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~last~0#1.base|) (forall ((v_ArrVal_2482 Int) (|ULTIMATE.start_main_~last~0#1.offset| Int) (v_ArrVal_2481 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2481) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (or (and (= .cse1 0) (forall ((v_ArrVal_2477 Int) (v_ArrVal_2480 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~0#1.base|) (+ |ULTIMATE.start_main_~last~0#1.offset| 12) v_ArrVal_2477)) |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2480) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 0))) (= (select (store |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base| v_ArrVal_2482) .cse1) 1)))) (not (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~first~0#1.base|) 1) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-18 20:32:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:38,002 INFO L93 Difference]: Finished difference Result 345 states and 388 transitions. [2021-12-18 20:32:38,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-18 20:32:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-18 20:32:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:38,003 INFO L225 Difference]: With dead ends: 345 [2021-12-18 20:32:38,003 INFO L226 Difference]: Without dead ends: 345 [2021-12-18 20:32:38,004 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 61 SyntacticMatches, 20 SemanticMatches, 61 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 790 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=433, Invalid=2153, Unknown=12, NotChecked=1308, Total=3906 [2021-12-18 20:32:38,005 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 204 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1579 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:38,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 790 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 552 Invalid, 0 Unknown, 1579 Unchecked, 0.3s Time] [2021-12-18 20:32:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-12-18 20:32:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 255. [2021-12-18 20:32:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 243 states have (on average 1.1975308641975309) internal successors, (291), 254 states have internal predecessors, (291), 0 states have call successors, (0), 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-18 20:32:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2021-12-18 20:32:38,011 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 42 [2021-12-18 20:32:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:38,011 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2021-12-18 20:32:38,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.189189189189189) internal successors, (118), 38 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2021-12-18 20:32:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 20:32:38,012 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:38,012 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:38,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:38,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-18 20:32:38,228 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:38,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1696179933, now seen corresponding path program 1 times [2021-12-18 20:32:38,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:38,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724200800] [2021-12-18 20:32:38,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:38,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:38,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:38,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724200800] [2021-12-18 20:32:38,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724200800] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146175026] [2021-12-18 20:32:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:38,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:38,390 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:38,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 20:32:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:38,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-18 20:32:38,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:38,558 INFO L388 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-18 20:32:38,616 INFO L388 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-18 20:32:38,623 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:38,624 INFO L388 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-18 20:32:38,767 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:38,770 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:38,802 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:32:38,802 INFO L388 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 38 treesize of output 37 [2021-12-18 20:32:38,807 INFO L388 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 18 treesize of output 20 [2021-12-18 20:32:38,867 INFO L388 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 15 treesize of output 7 [2021-12-18 20:32:38,869 INFO L388 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 25 treesize of output 13 [2021-12-18 20:32:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:38,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:39,031 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2644 (Array Int Int)) (v_ArrVal_2643 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2644) |c_ULTIMATE.start_main_~first~0#1.base|) .cse0))))) (forall ((v_ArrVal_2643 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2643) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)) 12)))) is different from false [2021-12-18 20:32:39,041 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:39,041 INFO L388 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 45 treesize of output 46 [2021-12-18 20:32:39,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:39,055 INFO L388 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 35 treesize of output 36 [2021-12-18 20:32:39,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:39,062 INFO L388 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 62 treesize of output 65 [2021-12-18 20:32:39,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:39,085 INFO L388 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 96 treesize of output 93 [2021-12-18 20:32:39,090 INFO L388 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 40 treesize of output 32 [2021-12-18 20:32:39,093 INFO L388 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 66 treesize of output 58 [2021-12-18 20:32:39,186 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:39,187 INFO L388 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 24 treesize of output 25 [2021-12-18 20:32:39,188 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:39,191 INFO L388 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 22 treesize of output 10 [2021-12-18 20:32:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:39,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146175026] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:39,400 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:39,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2021-12-18 20:32:39,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823302347] [2021-12-18 20:32:39,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:39,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 20:32:39,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 20:32:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=397, Unknown=1, NotChecked=40, Total=506 [2021-12-18 20:32:39,401 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:39,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:39,922 INFO L93 Difference]: Finished difference Result 365 states and 414 transitions. [2021-12-18 20:32:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:32:39,923 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-18 20:32:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:39,924 INFO L225 Difference]: With dead ends: 365 [2021-12-18 20:32:39,924 INFO L226 Difference]: Without dead ends: 365 [2021-12-18 20:32:39,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=722, Unknown=1, NotChecked=56, Total=930 [2021-12-18 20:32:39,924 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 222 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:39,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 714 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 720 Invalid, 0 Unknown, 191 Unchecked, 0.3s Time] [2021-12-18 20:32:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-18 20:32:39,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 309. [2021-12-18 20:32:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 297 states have (on average 1.2053872053872055) internal successors, (358), 308 states have internal predecessors, (358), 0 states have call successors, (0), 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-18 20:32:39,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 358 transitions. [2021-12-18 20:32:39,928 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 358 transitions. Word has length 42 [2021-12-18 20:32:39,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:39,928 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 358 transitions. [2021-12-18 20:32:39,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.045454545454546) internal successors, (111), 23 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 358 transitions. [2021-12-18 20:32:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-18 20:32:39,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:39,929 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:39,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:40,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-12-18 20:32:40,135 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:40,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:40,136 INFO L85 PathProgramCache]: Analyzing trace with hash -131950583, now seen corresponding path program 1 times [2021-12-18 20:32:40,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:40,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050274021] [2021-12-18 20:32:40,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:40,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:40,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050274021] [2021-12-18 20:32:40,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050274021] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:40,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581150293] [2021-12-18 20:32:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:40,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:40,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:40,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 20:32:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:40,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-18 20:32:40,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:40,629 INFO L388 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-18 20:32:40,632 INFO L388 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-18 20:32:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:40,660 INFO L388 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-18 20:32:40,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:40,665 INFO L388 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-18 20:32:40,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:40,676 INFO L388 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-18 20:32:40,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:40,681 INFO L388 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-18 20:32:40,786 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 20:32:40,786 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-18 20:32:40,806 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 20:32:40,806 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2021-12-18 20:32:40,911 INFO L354 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2021-12-18 20:32:40,911 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 48 [2021-12-18 20:32:40,928 INFO L354 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2021-12-18 20:32:40,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2021-12-18 20:32:40,947 INFO L388 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 13 treesize of output 9 [2021-12-18 20:32:40,966 INFO L388 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 13 treesize of output 9 [2021-12-18 20:32:40,980 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2021-12-18 20:32:40,992 INFO L388 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 5 treesize of output 3 [2021-12-18 20:32:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:41,047 INFO L388 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 33 treesize of output 32 [2021-12-18 20:32:41,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:41,052 INFO L388 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 33 treesize of output 32 [2021-12-18 20:32:41,065 INFO L388 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 31 treesize of output 30 [2021-12-18 20:32:41,068 INFO L388 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 31 treesize of output 30 [2021-12-18 20:32:41,114 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 20:32:41,115 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 34 [2021-12-18 20:32:41,125 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-18 20:32:41,125 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 40 [2021-12-18 20:32:41,432 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-12-18 20:32:41,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 57 [2021-12-18 20:32:41,448 INFO L354 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2021-12-18 20:32:41,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 34 [2021-12-18 20:32:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:41,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:41,949 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,032 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,130 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,248 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,269 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,389 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,517 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,549 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,705 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,868 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:42,888 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,063 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,089 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,116 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,328 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,590 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,590 INFO L388 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 2 case distinctions, treesize of input 545 treesize of output 489 [2021-12-18 20:32:43,592 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,594 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,595 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,602 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 468 [2021-12-18 20:32:43,608 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,608 INFO L388 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 2 case distinctions, treesize of input 468 treesize of output 323 [2021-12-18 20:32:43,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,610 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,622 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 182 [2021-12-18 20:32:43,627 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,682 INFO L354 Elim1Store]: treesize reduction 63, result has 49.2 percent of original size [2021-12-18 20:32:43,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 182 treesize of output 210 [2021-12-18 20:32:43,692 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,692 INFO L388 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 247 treesize of output 245 [2021-12-18 20:32:43,702 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:32:43,703 INFO L388 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 251 treesize of output 248 [2021-12-18 20:32:43,751 INFO L354 Elim1Store]: treesize reduction 95, result has 39.1 percent of original size [2021-12-18 20:32:43,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 248 treesize of output 260 [2021-12-18 20:32:43,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:43,773 INFO L388 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 375 treesize of output 369 [2021-12-18 20:32:43,798 INFO L388 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 267 treesize of output 265 [2021-12-18 20:32:43,803 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:32:43,805 INFO L388 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 238 treesize of output 228 [2021-12-18 20:32:43,879 INFO L388 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 6 treesize of output 4 [2021-12-18 20:32:43,906 INFO L388 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 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-18 20:32:43,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2021-12-18 20:32:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:43,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581150293] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:43,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:43,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 54 [2021-12-18 20:32:43,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030924123] [2021-12-18 20:32:43,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:43,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-18 20:32:43,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-18 20:32:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2176, Unknown=467, NotChecked=0, Total=2862 [2021-12-18 20:32:43,925 INFO L87 Difference]: Start difference. First operand 309 states and 358 transitions. Second operand has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:47,449 INFO L93 Difference]: Finished difference Result 555 states and 661 transitions. [2021-12-18 20:32:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-18 20:32:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-18 20:32:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:47,451 INFO L225 Difference]: With dead ends: 555 [2021-12-18 20:32:47,451 INFO L226 Difference]: Without dead ends: 555 [2021-12-18 20:32:47,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=931, Invalid=7351, Unknown=838, NotChecked=0, Total=9120 [2021-12-18 20:32:47,453 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 671 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 744 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:47,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [671 Valid, 1423 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1600 Invalid, 0 Unknown, 744 Unchecked, 0.8s Time] [2021-12-18 20:32:47,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-12-18 20:32:47,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 337. [2021-12-18 20:32:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1938461538461538) internal successors, (388), 336 states have internal predecessors, (388), 0 states have call successors, (0), 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-18 20:32:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 388 transitions. [2021-12-18 20:32:47,463 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 388 transitions. Word has length 42 [2021-12-18 20:32:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:47,464 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 388 transitions. [2021-12-18 20:32:47,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 388 transitions. [2021-12-18 20:32:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-18 20:32:47,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:47,464 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:47,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:47,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:47,680 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:47,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:47,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1041969739, now seen corresponding path program 1 times [2021-12-18 20:32:47,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:47,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953677063] [2021-12-18 20:32:47,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:47,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:47,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953677063] [2021-12-18 20:32:47,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953677063] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898872206] [2021-12-18 20:32:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:47,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:47,812 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:47,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 20:32:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:47,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-18 20:32:47,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:47,986 INFO L388 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-18 20:32:48,044 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:48,045 INFO L388 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-18 20:32:48,139 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:32:48,164 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:32:48,164 INFO L388 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 27 treesize of output 28 [2021-12-18 20:32:48,200 INFO L388 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 24 treesize of output 12 [2021-12-18 20:32:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:48,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:48,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2961 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_2961) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))))) is different from false [2021-12-18 20:32:48,250 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:48,250 INFO L388 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 23 treesize of output 24 [2021-12-18 20:32:48,255 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:48,256 INFO L388 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 39 treesize of output 42 [2021-12-18 20:32:48,258 INFO L388 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 22 treesize of output 18 [2021-12-18 20:32:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:48,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898872206] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:48,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:48,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2021-12-18 20:32:48,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257241642] [2021-12-18 20:32:48,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:48,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-18 20:32:48,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-18 20:32:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=222, Unknown=1, NotChecked=30, Total=306 [2021-12-18 20:32:48,460 INFO L87 Difference]: Start difference. First operand 337 states and 388 transitions. Second operand has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:48,837 INFO L93 Difference]: Finished difference Result 372 states and 412 transitions. [2021-12-18 20:32:48,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 20:32:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-12-18 20:32:48,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:48,838 INFO L225 Difference]: With dead ends: 372 [2021-12-18 20:32:48,838 INFO L226 Difference]: Without dead ends: 372 [2021-12-18 20:32:48,839 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=544, Unknown=1, NotChecked=50, Total=756 [2021-12-18 20:32:48,839 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 188 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 241 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:48,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 528 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 535 Invalid, 0 Unknown, 241 Unchecked, 0.2s Time] [2021-12-18 20:32:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-12-18 20:32:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 337. [2021-12-18 20:32:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 325 states have (on average 1.1876923076923076) internal successors, (386), 336 states have internal predecessors, (386), 0 states have call successors, (0), 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-18 20:32:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 386 transitions. [2021-12-18 20:32:48,843 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 386 transitions. Word has length 43 [2021-12-18 20:32:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:48,843 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 386 transitions. [2021-12-18 20:32:48,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.611111111111111) internal successors, (83), 18 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:32:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 386 transitions. [2021-12-18 20:32:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 20:32:48,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:48,843 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:48,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:49,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-18 20:32:49,066 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:49,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:49,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2058655426, now seen corresponding path program 1 times [2021-12-18 20:32:49,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:49,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385858999] [2021-12-18 20:32:49,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:49,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:49,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:49,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385858999] [2021-12-18 20:32:49,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385858999] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:49,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621877323] [2021-12-18 20:32:49,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:49,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:49,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:49,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:49,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 20:32:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:49,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 20:32:49,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:49,392 INFO L388 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-18 20:32:49,453 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:32:49,453 INFO L388 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-18 20:32:49,548 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:49,567 INFO L388 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 14 treesize of output 16 [2021-12-18 20:32:49,588 INFO L388 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 15 treesize of output 7 [2021-12-18 20:32:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:49,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:49,666 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:49,666 INFO L388 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 19 treesize of output 23 [2021-12-18 20:32:49,766 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3119 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3119) |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) is different from false [2021-12-18 20:32:49,770 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:49,770 INFO L388 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 22 treesize of output 23 [2021-12-18 20:32:49,775 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:49,775 INFO L388 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 36 treesize of output 39 [2021-12-18 20:32:49,777 INFO L388 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 11 treesize of output 7 [2021-12-18 20:32:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:49,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621877323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:49,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:49,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2021-12-18 20:32:49,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12343763] [2021-12-18 20:32:49,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:49,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 20:32:49,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 20:32:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=432, Unknown=1, NotChecked=42, Total=552 [2021-12-18 20:32:49,949 INFO L87 Difference]: Start difference. First operand 337 states and 386 transitions. Second operand has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 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-18 20:32:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:50,680 INFO L93 Difference]: Finished difference Result 438 states and 496 transitions. [2021-12-18 20:32:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 20:32:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-12-18 20:32:50,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:50,682 INFO L225 Difference]: With dead ends: 438 [2021-12-18 20:32:50,682 INFO L226 Difference]: Without dead ends: 438 [2021-12-18 20:32:50,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=400, Invalid=1583, Unknown=1, NotChecked=86, Total=2070 [2021-12-18 20:32:50,682 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 319 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:50,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 465 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 814 Invalid, 0 Unknown, 273 Unchecked, 0.4s Time] [2021-12-18 20:32:50,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-18 20:32:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 384. [2021-12-18 20:32:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 372 states have (on average 1.2150537634408602) internal successors, (452), 383 states have internal predecessors, (452), 0 states have call successors, (0), 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-18 20:32:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 452 transitions. [2021-12-18 20:32:50,687 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 452 transitions. Word has length 44 [2021-12-18 20:32:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:50,687 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 452 transitions. [2021-12-18 20:32:50,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.086956521739131) internal successors, (94), 24 states have internal predecessors, (94), 0 states have call successors, (0), 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-18 20:32:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 452 transitions. [2021-12-18 20:32:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 20:32:50,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:50,687 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:50,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-18 20:32:50,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-18 20:32:50,901 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:50,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 489910956, now seen corresponding path program 1 times [2021-12-18 20:32:50,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285838922] [2021-12-18 20:32:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:50,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:51,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285838922] [2021-12-18 20:32:51,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285838922] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:51,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288321159] [2021-12-18 20:32:51,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:51,015 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:51,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:51,016 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:51,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-18 20:32:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:51,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 20:32:51,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:32:51,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:32:51,446 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:51,446 INFO L388 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 25 [2021-12-18 20:32:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:32:51,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288321159] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:32:51,645 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:32:51,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2021-12-18 20:32:51,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504522142] [2021-12-18 20:32:51,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:32:51,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 20:32:51,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:32:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 20:32:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:32:51,647 INFO L87 Difference]: Start difference. First operand 384 states and 452 transitions. Second operand has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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-18 20:32:51,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:32:51,789 INFO L93 Difference]: Finished difference Result 385 states and 449 transitions. [2021-12-18 20:32:51,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:32:51,789 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-18 20:32:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:32:51,790 INFO L225 Difference]: With dead ends: 385 [2021-12-18 20:32:51,790 INFO L226 Difference]: Without dead ends: 385 [2021-12-18 20:32:51,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-18 20:32:51,791 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:32:51,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 145 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:32:51,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-12-18 20:32:51,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2021-12-18 20:32:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 347 states have (on average 1.2132564841498559) internal successors, (421), 358 states have internal predecessors, (421), 0 states have call successors, (0), 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-18 20:32:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 421 transitions. [2021-12-18 20:32:51,796 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 421 transitions. Word has length 46 [2021-12-18 20:32:51,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:32:51,796 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 421 transitions. [2021-12-18 20:32:51,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.5) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 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-18 20:32:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 421 transitions. [2021-12-18 20:32:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-18 20:32:51,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:32:51,797 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:32:51,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-18 20:32:52,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-12-18 20:32:52,015 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:32:52,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:32:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1931630812, now seen corresponding path program 1 times [2021-12-18 20:32:52,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:32:52,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723173051] [2021-12-18 20:32:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:52,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:32:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:52,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:32:52,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723173051] [2021-12-18 20:32:52,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723173051] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:32:52,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696189977] [2021-12-18 20:32:52,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:32:52,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:32:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:32:52,423 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:32:52,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-18 20:32:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:32:52,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 90 conjunts are in the unsatisfiable core [2021-12-18 20:32:52,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:32:52,652 INFO L388 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-18 20:32:52,655 INFO L388 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-18 20:32:52,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:52,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 20:32:52,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,676 INFO L388 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-18 20:32:52,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,681 INFO L388 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-18 20:32:52,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,715 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:52,715 INFO L388 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-18 20:32:52,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,721 INFO L388 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-18 20:32:52,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:52,735 INFO L388 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 1 case distinctions, treesize of input 30 treesize of output 32 [2021-12-18 20:32:52,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,745 INFO L388 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-18 20:32:52,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,874 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 20:32:52,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 30 [2021-12-18 20:32:52,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:52,888 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-18 20:32:52,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2021-12-18 20:32:53,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:53,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:53,039 INFO L354 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2021-12-18 20:32:53,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 68 [2021-12-18 20:32:53,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:53,074 INFO L354 Elim1Store]: treesize reduction 64, result has 39.6 percent of original size [2021-12-18 20:32:53,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 48 treesize of output 63 [2021-12-18 20:32:57,428 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-18 20:32:57,428 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2021-12-18 20:32:57,446 INFO L354 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2021-12-18 20:32:57,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 54 [2021-12-18 20:32:57,468 INFO L388 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 13 treesize of output 9 [2021-12-18 20:32:57,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,491 INFO L354 Elim1Store]: treesize reduction 13, result has 43.5 percent of original size [2021-12-18 20:32:57,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 23 [2021-12-18 20:32:57,524 INFO L388 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 5 treesize of output 3 [2021-12-18 20:32:57,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,538 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-18 20:32:57,685 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:32:57,685 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2021-12-18 20:32:57,697 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:32:57,697 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2021-12-18 20:32:57,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,758 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 20:32:57,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 20:32:57,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,897 INFO L354 Elim1Store]: treesize reduction 38, result has 40.6 percent of original size [2021-12-18 20:32:57,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 63 [2021-12-18 20:32:57,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:32:57,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2021-12-18 20:32:58,150 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:58,150 INFO L388 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 38 treesize of output 34 [2021-12-18 20:32:58,159 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:32:58,159 INFO L388 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 34 treesize of output 34 [2021-12-18 20:32:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:32:58,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:33:30,139 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse4 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4))) (let ((.cse0 (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3488)))) (store .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse1 (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse4 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (not (= 0 (select .cse0 |ULTIMATE.start_main_~x~1#1.offset|))) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse1 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse0 .cse2)) (= 0 (select .cse1 .cse2)))) (< |c_ULTIMATE.start_main_#t~mem7#1.offset| v_ArrVal_3488))))) is different from false [2021-12-18 20:33:30,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse0 (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse4)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse2 (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3488)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse0 .cse1)) (= 0 (select .cse2 .cse1)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (= (select .cse0 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= 0 (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|))))))) is different from false [2021-12-18 20:33:32,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse4)))) (store .cse6 .cse4 (store (select .cse6 .cse4) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse0 (store (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488)))) (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse0 .cse1)) (= 0 (select .cse2 .cse1)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= 0 (select .cse0 |ULTIMATE.start_main_~x~1#1.offset|))))))) is different from false [2021-12-18 20:33:39,439 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3494 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3480) .cse12 v_ArrVal_3487))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse2 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3482) .cse12 v_ArrVal_3486))) (let ((.cse0 (store (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse2))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse9 .cse5 (store (select .cse9 .cse5) .cse6 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse1 (store (select (store (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse8))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse5))))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse0 |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse1 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse0 .cse3)) (= 0 (select .cse1 .cse3)))))))))) is different from false [2021-12-18 20:33:42,137 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3494 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse8 (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3480) .cse12 v_ArrVal_3487))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse3 (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse11 v_ArrVal_3482) .cse12 v_ArrVal_3486))) (let ((.cse0 (store (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse3))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse9 .cse5 (store (select .cse9 .cse5) .cse6 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse2 (store (select (store (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse8))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse5))))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse0 .cse1)) (= 0 (select .cse2 .cse1)))) (not (= 0 (select .cse0 |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (< (select .cse3 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488))))))) is different from false [2021-12-18 20:33:47,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3472 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse10 (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3472) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3480) .cse13 v_ArrVal_3487))) (let ((.cse0 (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse11 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse12 v_ArrVal_3482) .cse13 v_ArrVal_3486)) (.cse6 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse5 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (store (select (store (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse10))) (store .cse9 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse9 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse5))))) (store .cse8 .cse5 (store (select .cse8 .cse5) .cse6 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse3 (store (select (store (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse0))) (store .cse7 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse7 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse1 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse1 .cse2)) (= 0 (select .cse3 .cse2)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse3 |ULTIMATE.start_main_~x~1#1.offset|))))))))) is different from false [2021-12-18 20:33:47,905 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:47,905 INFO L388 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 2 case distinctions, treesize of input 706 treesize of output 509 [2021-12-18 20:33:47,926 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:47,926 INFO L388 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 2 case distinctions, treesize of input 711 treesize of output 492 [2021-12-18 20:33:47,930 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,934 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,935 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:47,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:47,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 192 treesize of output 211 [2021-12-18 20:33:48,073 INFO L354 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2021-12-18 20:33:48,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 136 [2021-12-18 20:33:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,080 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,082 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,083 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,084 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,085 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,086 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,087 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,128 INFO L354 Elim1Store]: treesize reduction 64, result has 57.0 percent of original size [2021-12-18 20:33:48,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 88 [2021-12-18 20:33:48,137 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:48,144 INFO L388 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 25 treesize of output 29 [2021-12-18 20:33:48,148 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,155 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:48,155 INFO L388 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 25 treesize of output 29 [2021-12-18 20:33:48,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,163 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,164 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,166 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,167 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,180 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:48,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 87 treesize of output 91 [2021-12-18 20:33:48,187 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:33:48,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 9 [2021-12-18 20:33:48,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 20:33:48,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696189977] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:33:48,241 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:33:48,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 25] total 54 [2021-12-18 20:33:48,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265212890] [2021-12-18 20:33:48,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:33:48,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-18 20:33:48,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:33:48,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-18 20:33:48,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1837, Unknown=185, NotChecked=582, Total=2862 [2021-12-18 20:33:48,243 INFO L87 Difference]: Start difference. First operand 359 states and 421 transitions. Second operand has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:33:48,297 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3472 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3472) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3480) .cse14 v_ArrVal_3487))) (let ((.cse1 (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse13 v_ArrVal_3482) .cse14 v_ArrVal_3486)) (.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse11))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse4 (store (select (store (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse1))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse2 .cse3)) (= 0 (select .cse4 .cse3)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse4 |ULTIMATE.start_main_~x~1#1.offset|))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= 0 |c_ULTIMATE.start_main_~first~0#1.base|))) is different from false [2021-12-18 20:33:48,308 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3494 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse9 (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3480) .cse13 v_ArrVal_3487))) (let ((.cse6 (select .cse9 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse4 (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse12 v_ArrVal_3482) .cse13 v_ArrVal_3486))) (let ((.cse1 (store (select (store (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse4))) (store .cse11 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse11 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse10 .cse6 (store (select .cse10 .cse6) .cse7 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse3 (store (select (store (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse9))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse1 .cse2)) (= 0 (select .cse3 .cse2)))) (not (= 0 (select .cse1 |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse3 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (< (select .cse4 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488))))))))) is different from false [2021-12-18 20:33:48,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse1 .cse2) 0) (= (select .cse0 .cse2) 0) (= (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) 0) (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3494 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse15 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3480) .cse15 v_ArrVal_3487))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse9 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse5 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse14 v_ArrVal_3482) .cse15 v_ArrVal_3486))) (let ((.cse3 (store (select (store (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse5))) (store .cse13 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse13 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse12 .cse8 (store (select .cse12 .cse8) .cse9 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse4 (store (select (store (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse11))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse8))))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse3 |ULTIMATE.start_main_~x~1#1.offset|))) (= (select .cse4 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< (select .cse5 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (let ((.cse6 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse3 .cse6)) (= 0 (select .cse4 .cse6)))))))))))) is different from false [2021-12-18 20:33:48,346 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select .cse1 .cse2) 0) (= (select .cse0 .cse2) 0) (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse8 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse5 (store (select (store (let ((.cse9 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) 0 .cse7)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse3 (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488)))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (let ((.cse4 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse3 .cse4)) (= 0 (select .cse5 .cse4)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (= (select .cse5 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= 0 (select .cse3 |ULTIMATE.start_main_~x~1#1.offset|))))))) (= (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2021-12-18 20:33:48,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse1 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse2 (= (select .cse12 .cse11) 0)) (.cse3 (= (select .cse0 .cse11) 0))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse2 .cse3 (= .cse1 0) (= 0 |c_ULTIMATE.start_main_~y~0#1.offset|) (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (store (select (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| .cse8)))) (store .cse10 .cse8 (store (select .cse10 .cse8) .cse9 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse6 (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3488)))) (store .cse7 .cse8 (store (select .cse7 .cse8) .cse9 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (let ((.cse5 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse4 .cse5)) (= 0 (select .cse6 .cse5)))) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (= (select .cse4 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= 0 (select .cse6 |ULTIMATE.start_main_~x~1#1.offset|))))))) (or (and .cse2 .cse3) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from false [2021-12-18 20:33:48,408 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12)) (.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse10 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse8 (= (select .cse12 .cse11) 0)) (.cse9 (= (select .cse10 .cse11) 0))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_3503 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int) (v_ArrVal_3494 Int)) (let ((.cse5 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4))) (let ((.cse1 (store (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| v_ArrVal_3488)))) (store .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse5 |c_ULTIMATE.start_main_~y~0#1.offset|))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503)) (.cse2 (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_#t~mem7#1.base|)))) (store .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem7#1.base|) .cse5 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|))) (or (not (= 0 (select .cse1 |ULTIMATE.start_main_~x~1#1.offset|))) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse1 .cse3)) (= 0 (select .cse2 .cse3)))) (< |c_ULTIMATE.start_main_#t~mem7#1.offset| v_ArrVal_3488))))) (= |c_ULTIMATE.start_main_#t~mem7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (<= .cse7 |c_ULTIMATE.start_main_~x~0#1.offset|) .cse8 .cse9 (= |c_ULTIMATE.start_main_#t~mem7#1.offset| 0) (= |c_ULTIMATE.start_main_#t~mem7#1.base| .cse0) (<= |c_ULTIMATE.start_main_#t~mem7#1.offset| .cse7) (= 0 |c_ULTIMATE.start_main_~y~0#1.offset|) (or (and .cse8 .cse9) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|))))) is different from false [2021-12-18 20:33:48,556 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~first~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3472 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3472) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3480) .cse14 v_ArrVal_3487))) (let ((.cse1 (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse13 v_ArrVal_3482) .cse14 v_ArrVal_3486)) (.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse11))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse4 (store (select (store (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse1))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse2 .cse3)) (= 0 (select .cse4 .cse3)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse4 |ULTIMATE.start_main_~x~1#1.offset|))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (let ((.cse15 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~first~0#1.base|))) (or (= (select .cse15 |c_ULTIMATE.start_main_~first~0#1.offset|) |c_ULTIMATE.start_main_~first~0#1.base|) (let ((.cse16 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (and (= (select .cse15 .cse16) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~first~0#1.base|) .cse16) 0))))))) is different from false [2021-12-18 20:33:48,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0) (forall ((v_ArrVal_3503 Int) (v_ArrVal_3487 Int) (v_ArrVal_3477 Int) (v_ArrVal_3488 Int) (|ULTIMATE.start_main_~x~1#1.offset| Int) (v_ArrVal_3486 Int) (v_ArrVal_3472 Int) (v_ArrVal_3494 Int) (v_ArrVal_3473 Int) (v_ArrVal_3482 Int) (v_ArrVal_3480 Int) (|ULTIMATE.start_main_~y~0#1.base| Int) (v_ArrVal_3498 (Array Int Int)) (v_ArrVal_3499 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem8#1.offset_24| Int)) (let ((.cse12 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16)) (.cse13 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) (.cse14 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (let ((.cse11 (store (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3472) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse13 v_ArrVal_3480) .cse14 v_ArrVal_3487))) (let ((.cse1 (store (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse12 v_ArrVal_3473) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) .cse13 v_ArrVal_3482) .cse14 v_ArrVal_3486)) (.cse7 (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_24| 4)) (.cse6 (select .cse11 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (store (select (store (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse11))) (store .cse10 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse10 |ULTIMATE.start_main_~y~0#1.base|) 0 .cse6))))) (store .cse9 .cse6 (store (select .cse9 .cse6) .cse7 v_ArrVal_3494))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3498) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.base|)) (.cse4 (store (select (store (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| .cse1))) (store .cse8 |ULTIMATE.start_main_~y~0#1.base| (store (select .cse8 |ULTIMATE.start_main_~y~0#1.base|) 0 v_ArrVal_3488))))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 0))) |ULTIMATE.start_main_~y~0#1.base| v_ArrVal_3499) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3503))) (or (< (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_3488) (< 0 |ULTIMATE.start_main_~x~1#1.offset|) (= (select .cse2 |ULTIMATE.start_main_~x~1#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (let ((.cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 12))) (and (= 0 (select .cse2 .cse3)) (= 0 (select .cse4 .cse3)))) (< |ULTIMATE.start_main_~x~1#1.offset| 0) (< |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_3477) (< v_ArrVal_3488 |v_ULTIMATE.start_main_#t~mem8#1.offset_24|) (not (= 0 (select .cse4 |ULTIMATE.start_main_~x~1#1.offset|))))))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0) 0))) is different from false [2021-12-18 20:33:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:33:49,382 INFO L93 Difference]: Finished difference Result 381 states and 442 transitions. [2021-12-18 20:33:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-18 20:33:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-12-18 20:33:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:33:49,383 INFO L225 Difference]: With dead ends: 381 [2021-12-18 20:33:49,383 INFO L226 Difference]: Without dead ends: 381 [2021-12-18 20:33:49,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=456, Invalid=3024, Unknown=236, NotChecked=1834, Total=5550 [2021-12-18 20:33:49,384 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 166 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 759 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:33:49,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 864 Invalid, 1270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 491 Invalid, 0 Unknown, 759 Unchecked, 0.2s Time] [2021-12-18 20:33:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-18 20:33:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2021-12-18 20:33:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 351 states have (on average 1.210826210826211) internal successors, (425), 362 states have internal predecessors, (425), 0 states have call successors, (0), 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-18 20:33:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 425 transitions. [2021-12-18 20:33:49,388 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 425 transitions. Word has length 46 [2021-12-18 20:33:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:33:49,389 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 425 transitions. [2021-12-18 20:33:49,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.074074074074074) internal successors, (112), 54 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:33:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 425 transitions. [2021-12-18 20:33:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-18 20:33:49,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:33:49,390 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:33:49,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-18 20:33:49,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:33:49,607 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 37 more)] === [2021-12-18 20:33:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:33:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1565727437, now seen corresponding path program 1 times [2021-12-18 20:33:49,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:33:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72790705] [2021-12-18 20:33:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:33:49,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:33:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:33:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:33:49,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:33:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72790705] [2021-12-18 20:33:49,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72790705] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:33:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568909658] [2021-12-18 20:33:49,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:33:49,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:33:49,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:33:49,857 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:33:49,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-18 20:33:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:33:50,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-18 20:33:50,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:33:50,073 INFO L388 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-18 20:33:50,132 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:33:50,133 INFO L388 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-18 20:33:50,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:33:50,199 INFO L388 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 11 treesize of output 7 [2021-12-18 20:33:50,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:33:50,252 INFO L388 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 21 treesize of output 20 [2021-12-18 20:33:50,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:33:50,275 INFO L388 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 21 treesize of output 20 [2021-12-18 20:33:50,343 INFO L388 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 19 treesize of output 18 [2021-12-18 20:33:50,351 INFO L388 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 11 treesize of output 7 [2021-12-18 20:33:50,385 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:50,385 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 43 [2021-12-18 20:33:50,387 INFO L388 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 18 treesize of output 20 [2021-12-18 20:33:50,453 INFO L388 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 15 treesize of output 7 [2021-12-18 20:33:50,621 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:33:50,661 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:50,661 INFO L388 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2021-12-18 20:33:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:33:50,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:33:50,696 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-18 20:33:50,696 INFO L388 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 16 treesize of output 15 [2021-12-18 20:33:50,820 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3672 (Array Int Int)) (v_ArrVal_3671 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3671))) (.cse3 (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~first~0#1.base|) .cse3)) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_3672) |c_ULTIMATE.start_main_~first~0#1.base|) .cse3))) (or (= (select (select .cse0 .cse1) .cse2) .cse1) (< (select |c_#length| .cse1) (+ .cse2 16)))))) is different from false [2021-12-18 20:33:50,827 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:50,828 INFO L388 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 191 treesize of output 181 [2021-12-18 20:33:50,836 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:33:50,836 INFO L388 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 353 treesize of output 350 [2021-12-18 20:33:50,844 INFO L388 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 169 treesize of output 161 [2021-12-18 20:34:11,481 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_291 Int) (v_ArrVal_3665 Int) (v_ArrVal_3671 Int) (v_arrayElimCell_290 Int)) (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3665)))) (store .cse7 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3671))))) (let ((.cse2 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12)))) (let ((.cse1 (select |c_#length| .cse4)) (.cse0 (not .cse2)) (.cse3 (select .cse5 .cse4))) (or (and .cse0 (< .cse1 (+ v_arrayElimCell_290 16))) (and .cse2 (< .cse1 (+ v_arrayElimCell_291 16))) (and (= (select .cse3 v_arrayElimCell_291) .cse4) .cse2) (and .cse0 (= (select .cse3 v_arrayElimCell_290) .cse4)) (and (not (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimCell_290)) (= |c_ULTIMATE.start_main_~last~0#1.offset| |c_ULTIMATE.start_main_~first~0#1.offset|) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))))))) is different from false [2021-12-18 20:34:16,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_291 Int) (v_ArrVal_3665 Int) (v_ArrVal_3662 Int) (v_ArrVal_3671 Int) (v_arrayElimCell_290 Int)) (let ((.cse5 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_3662) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_3665)))) (store .cse7 |c_ULTIMATE.start_main_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~last~0#1.base|) (+ |c_ULTIMATE.start_main_~last~0#1.offset| 12) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse6 |c_ULTIMATE.start_main_~x~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 16) v_ArrVal_3671))))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~first~0#1.base|) (+ |c_ULTIMATE.start_main_~first~0#1.offset| 12))) (.cse4 (= |c_ULTIMATE.start_main_~first~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse2 (select .cse5 .cse3)) (.cse1 (select |c_#length| .cse3))) (or (and .cse0 (< .cse1 (+ v_arrayElimCell_290 16))) (and .cse0 (= (select .cse2 v_arrayElimCell_290) .cse3)) (and (= (select .cse2 v_arrayElimCell_291) .cse3) .cse4) (and .cse4 (< .cse1 (+ v_arrayElimCell_291 16))) (and (not (= |c_ULTIMATE.start_main_~x~0#1.offset| v_arrayElimCell_290)) (= |c_ULTIMATE.start_main_~last~0#1.offset| |c_ULTIMATE.start_main_~first~0#1.offset|) (= |c_ULTIMATE.start_main_~last~0#1.base| |c_ULTIMATE.start_main_~first~0#1.base|))))))) is different from false [2021-12-18 20:34:16,335 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:34:16,336 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:34:16,337 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:34:18,285 INFO L354 Elim1Store]: treesize reduction 1431, result has 34.6 percent of original size [2021-12-18 20:34:18,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 49 case distinctions, treesize of input 28051947 treesize of output 25420898 Killed by 15