./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/list-simple/dll2n_remove_all_reverse.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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:02:21,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:02:21,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:02:21,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:02:21,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:02:21,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:02:21,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:02:21,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:02:21,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:02:21,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:02:21,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:02:21,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:02:21,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:02:21,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:02:21,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:02:21,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:02:21,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:02:21,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:02:21,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:02:21,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:02:21,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:02:21,708 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:02:21,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:02:21,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:02:21,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:02:21,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:02:21,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:02:21,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:02:21,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:02:21,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:02:21,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:02:21,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:02:21,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:02:21,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:02:21,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:02:21,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:02:21,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:02:21,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:02:21,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:02:21,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:02:21,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:02:21,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:02:21,731 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:02:21,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:02:21,732 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:02:21,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:02:21,732 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:02:21,733 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:02:21,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:02:21,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:02:21,733 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:02:21,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:02:21,733 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:02:21,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:02:21,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:02:21,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:21,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:02:21,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:02:21,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:02:21,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:02:21,736 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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2021-12-28 06:02:22,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:02:22,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:02:22,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:02:22,050 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:02:22,051 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:02:22,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2021-12-28 06:02:22,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553c5f014/bc8119b966da4a038186988a3ec7e12b/FLAGe9d5667ae [2021-12-28 06:02:22,529 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:02:22,529 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2021-12-28 06:02:22,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553c5f014/bc8119b966da4a038186988a3ec7e12b/FLAGe9d5667ae [2021-12-28 06:02:22,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/553c5f014/bc8119b966da4a038186988a3ec7e12b [2021-12-28 06:02:22,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:02:22,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:02:22,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:22,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:02:22,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:02:22,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d8ae13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22, skipping insertion in model container [2021-12-28 06:02:22,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:02:22,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:02:22,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2021-12-28 06:02:22,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:22,857 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:02:22,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2021-12-28 06:02:22,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:22,918 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:02:22,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22 WrapperNode [2021-12-28 06:02:22,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:22,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:22,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:02:22,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:02:22,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,978 INFO L137 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2021-12-28 06:02:22,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:22,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:02:22,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:02:22,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:02:22,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:22,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:23,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:23,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:23,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:23,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:02:23,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:02:23,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:02:23,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:02:23,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (1/1) ... [2021-12-28 06:02:23,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:23,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:23,061 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-28 06:02:23,109 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-28 06:02:23,123 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-28 06:02:23,124 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-28 06:02:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:02:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:02:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:02:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 06:02:23,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:02:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:02:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:02:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 06:02:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:02:23,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:02:23,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:02:23,220 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:02:23,222 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:02:23,260 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-28 06:02:23,478 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:02:23,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:02:23,498 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-28 06:02:23,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:23 BoogieIcfgContainer [2021-12-28 06:02:23,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:02:23,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:02:23,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:02:23,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:02:23,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:02:22" (1/3) ... [2021-12-28 06:02:23,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a5f0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:23, skipping insertion in model container [2021-12-28 06:02:23,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:22" (2/3) ... [2021-12-28 06:02:23,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a5f0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:23, skipping insertion in model container [2021-12-28 06:02:23,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:23" (3/3) ... [2021-12-28 06:02:23,506 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2021-12-28 06:02:23,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:02:23,510 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2021-12-28 06:02:23,546 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:02:23,552 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-28 06:02:23,553 INFO L340 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2021-12-28 06:02:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:23,577 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:23,577 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:23,578 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-28 06:02:23,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:23,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753299104] [2021-12-28 06:02:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:23,732 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-28 06:02:23,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:23,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753299104] [2021-12-28 06:02:23,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753299104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:23,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:23,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:23,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796655923] [2021-12-28 06:02:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:23,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:23,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:23,765 INFO L87 Difference]: Start difference. First operand has 76 states, 40 states have (on average 2.1) internal successors, (84), 74 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:23,901 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2021-12-28 06:02:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:23,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:23,909 INFO L225 Difference]: With dead ends: 120 [2021-12-28 06:02:23,909 INFO L226 Difference]: Without dead ends: 115 [2021-12-28 06:02:23,911 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-28 06:02:23,914 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:23,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:23,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-28 06:02:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 68. [2021-12-28 06:02:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.945945945945946) internal successors, (72), 67 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-28 06:02:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-12-28 06:02:23,949 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 5 [2021-12-28 06:02:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:23,949 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-12-28 06:02:23,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:23,950 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-12-28 06:02:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:23,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:23,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:23,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:02:23,951 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-28 06:02:23,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:23,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5038875] [2021-12-28 06:02:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:23,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,016 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-28 06:02:24,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5038875] [2021-12-28 06:02:24,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5038875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:24,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:24,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:24,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816608807] [2021-12-28 06:02:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:24,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:24,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:24,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:24,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:24,021 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:24,121 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2021-12-28 06:02:24,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:24,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:24,122 INFO L225 Difference]: With dead ends: 119 [2021-12-28 06:02:24,123 INFO L226 Difference]: Without dead ends: 119 [2021-12-28 06:02:24,123 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-28 06:02:24,125 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 65 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:24,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 138 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-28 06:02:24,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 65. [2021-12-28 06:02:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-12-28 06:02:24,131 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 5 [2021-12-28 06:02:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:24,131 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-12-28 06:02:24,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-28 06:02:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-12-28 06:02:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-28 06:02:24,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:24,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:24,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:02:24,132 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113103, now seen corresponding path program 1 times [2021-12-28 06:02:24,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:24,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282443443] [2021-12-28 06:02:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,167 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-28 06:02:24,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282443443] [2021-12-28 06:02:24,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282443443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:24,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:24,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:24,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127240890] [2021-12-28 06:02:24,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:24,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:24,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:24,171 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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-28 06:02:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:24,180 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2021-12-28 06:02:24,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:24,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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-28 06:02:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:24,183 INFO L225 Difference]: With dead ends: 75 [2021-12-28 06:02:24,184 INFO L226 Difference]: Without dead ends: 75 [2021-12-28 06:02:24,184 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-28 06:02:24,188 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:24,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 132 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:24,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-28 06:02:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2021-12-28 06:02:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 65 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-28 06:02:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-12-28 06:02:24,202 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2021-12-28 06:02:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:24,203 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-12-28 06:02:24,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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-28 06:02:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-12-28 06:02:24,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:02:24,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:24,204 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:24,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:02:24,205 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-28 06:02:24,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:24,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523223214] [2021-12-28 06:02:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,269 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-28 06:02:24,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523223214] [2021-12-28 06:02:24,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523223214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:24,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:24,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:24,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755862301] [2021-12-28 06:02:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:24,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:24,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:24,272 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:24,293 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2021-12-28 06:02:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:24,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2021-12-28 06:02:24,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:24,294 INFO L225 Difference]: With dead ends: 72 [2021-12-28 06:02:24,294 INFO L226 Difference]: Without dead ends: 72 [2021-12-28 06:02:24,294 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-28 06:02:24,299 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:24,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-28 06:02:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2021-12-28 06:02:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.744186046511628) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-12-28 06:02:24,310 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 9 [2021-12-28 06:02:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:24,310 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-12-28 06:02:24,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-12-28 06:02:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 06:02:24,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:24,311 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:24,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:02:24,311 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:24,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -763066850, now seen corresponding path program 1 times [2021-12-28 06:02:24,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:24,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762747] [2021-12-28 06:02:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:24,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762747] [2021-12-28 06:02:24,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762747] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:24,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005331037] [2021-12-28 06:02:24,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:24,379 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-28 06:02:24,380 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-28 06:02:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:24,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:24,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:24,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005331037] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:24,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:24,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-28 06:02:24,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866409512] [2021-12-28 06:02:24,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:24,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:24,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:24,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:24,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:24,580 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:24,590 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-12-28 06:02:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 14 [2021-12-28 06:02:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:24,593 INFO L225 Difference]: With dead ends: 73 [2021-12-28 06:02:24,593 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 06:02:24,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:24,594 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:24,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 06:02:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 06:02:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.711111111111111) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-28 06:02:24,596 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 14 [2021-12-28 06:02:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:24,597 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-28 06:02:24,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-28 06:02:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:24,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:24,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:24,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:24,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:24,798 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:24,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-28 06:02:24,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:24,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731444918] [2021-12-28 06:02:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,889 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-28 06:02:24,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:24,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731444918] [2021-12-28 06:02:24,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731444918] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646536179] [2021-12-28 06:02:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:24,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:24,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:24,896 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-28 06:02:24,897 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-28 06:02:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:24,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 06:02:24,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:24,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:25,027 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 06:02:25,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 06:02:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:25,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:25,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646536179] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:25,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:25,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-28 06:02:25,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92296451] [2021-12-28 06:02:25,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:25,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:25,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:25,179 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:25,267 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2021-12-28 06:02:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-28 06:02:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:25,268 INFO L225 Difference]: With dead ends: 116 [2021-12-28 06:02:25,269 INFO L226 Difference]: Without dead ends: 116 [2021-12-28 06:02:25,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:25,269 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 161 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:25,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 154 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 101 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2021-12-28 06:02:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-28 06:02:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2021-12-28 06:02:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2021-12-28 06:02:25,273 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2021-12-28 06:02:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:25,273 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-12-28 06:02:25,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2021-12-28 06:02:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:25,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:25,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:25,295 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-28 06:02:25,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 06:02:25,481 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:25,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-28 06:02:25,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:25,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867652] [2021-12-28 06:02:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:25,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:25,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:25,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867652] [2021-12-28 06:02:25,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867652] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:25,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988309696] [2021-12-28 06:02:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:25,561 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:25,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:25,562 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-28 06:02:25,564 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-28 06:02:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:25,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 06:02:25,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:25,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:25,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:25,723 INFO L387 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-28 06:02:25,729 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:25,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:25,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:25,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:25,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-12-28 06:02:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988309696] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:26,033 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:26,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-28 06:02:26,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697572380] [2021-12-28 06:02:26,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 06:02:26,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 06:02:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:26,035 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,170 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2021-12-28 06:02:26,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:26,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 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-28 06:02:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,174 INFO L225 Difference]: With dead ends: 115 [2021-12-28 06:02:26,175 INFO L226 Difference]: Without dead ends: 115 [2021-12-28 06:02:26,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:02:26,175 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 223 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 128 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 148 Invalid, 0 Unknown, 120 Unchecked, 0.1s Time] [2021-12-28 06:02:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-12-28 06:02:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2021-12-28 06:02:26,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.6666666666666667) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-12-28 06:02:26,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 16 [2021-12-28 06:02:26,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,179 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-12-28 06:02:26,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 14 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,179 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-12-28 06:02:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 06:02:26,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:26,199 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-28 06:02:26,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:26,394 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:26,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 2 times [2021-12-28 06:02:26,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507410285] [2021-12-28 06:02:26,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507410285] [2021-12-28 06:02:26,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507410285] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:26,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989955009] [2021-12-28 06:02:26,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:26,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:26,460 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-28 06:02:26,461 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-28 06:02:26,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 06:02:26,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:26,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:02:26,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:26,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:26,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989955009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:26,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-28 06:02:26,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198149565] [2021-12-28 06:02:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:26,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:26,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:26,559 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,569 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2021-12-28 06:02:26,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:26,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 21 [2021-12-28 06:02:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,572 INFO L225 Difference]: With dead ends: 114 [2021-12-28 06:02:26,572 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 06:02:26,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:26,573 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 144 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 127 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 06:02:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 72. [2021-12-28 06:02:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2021-12-28 06:02:26,587 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 21 [2021-12-28 06:02:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,587 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2021-12-28 06:02:26,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2021-12-28 06:02:26,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 06:02:26,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,588 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:26,605 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-28 06:02:26,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:26,795 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:26,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2021-12-28 06:02:26,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487447072] [2021-12-28 06:02:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487447072] [2021-12-28 06:02:26,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487447072] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163567803] [2021-12-28 06:02:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:26,844 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-28 06:02:26,845 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-28 06:02:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:26,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:26,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163567803] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:26,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:26,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-28 06:02:26,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792362707] [2021-12-28 06:02:26,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:26,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:26,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:26,992 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:27,011 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-28 06:02:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:27,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-12-28 06:02:27,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:27,012 INFO L225 Difference]: With dead ends: 72 [2021-12-28 06:02:27,012 INFO L226 Difference]: Without dead ends: 72 [2021-12-28 06:02:27,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-28 06:02:27,013 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:27,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 63 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-28 06:02:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-12-28 06:02:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2021-12-28 06:02:27,016 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 21 [2021-12-28 06:02:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:27,016 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2021-12-28 06:02:27,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,016 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2021-12-28 06:02:27,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 06:02:27,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:27,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:27,067 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-28 06:02:27,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,236 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:27,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2021-12-28 06:02:27,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:27,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067524472] [2021-12-28 06:02:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:27,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:27,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067524472] [2021-12-28 06:02:27,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067524472] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:27,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149997193] [2021-12-28 06:02:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:27,299 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-28 06:02:27,300 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-28 06:02:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-28 06:02:27,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:27,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:27,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:27,411 INFO L387 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-28 06:02:27,430 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:27,431 INFO L387 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 14 [2021-12-28 06:02:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:02:27,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 06:02:27,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149997193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:27,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:27,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2021-12-28 06:02:27,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691205814] [2021-12-28 06:02:27,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:27,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:27,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:27,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:27,521 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:27,611 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2021-12-28 06:02:27,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:27,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-28 06:02:27,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:27,613 INFO L225 Difference]: With dead ends: 113 [2021-12-28 06:02:27,613 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 06:02:27,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:27,613 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:27,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 94 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 2 Unchecked, 0.1s Time] [2021-12-28 06:02:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 06:02:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2021-12-28 06:02:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.5957446808510638) internal successors, (75), 70 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-12-28 06:02:27,619 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 22 [2021-12-28 06:02:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:27,620 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-12-28 06:02:27,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-12-28 06:02:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 06:02:27,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:27,621 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:27,641 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-28 06:02:27,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,831 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2021-12-28 06:02:27,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:27,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601207958] [2021-12-28 06:02:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:27,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601207958] [2021-12-28 06:02:27,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601207958] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:27,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149170424] [2021-12-28 06:02:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:27,941 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-28 06:02:27,942 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-28 06:02:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-28 06:02:28,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:28,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:28,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:28,078 INFO L387 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-28 06:02:28,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:28,124 INFO L387 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-28 06:02:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:28,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:28,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149170424] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:28,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:28,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2021-12-28 06:02:28,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110314321] [2021-12-28 06:02:28,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:28,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 06:02:28,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:28,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 06:02:28,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:28,564 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:28,678 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-12-28 06:02:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 22 [2021-12-28 06:02:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:28,680 INFO L225 Difference]: With dead ends: 96 [2021-12-28 06:02:28,680 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 06:02:28,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2021-12-28 06:02:28,680 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 361 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:28,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 50 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:28,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 06:02:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2021-12-28 06:02:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-12-28 06:02:28,682 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 22 [2021-12-28 06:02:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:28,682 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-12-28 06:02:28,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-12-28 06:02:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:28,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:28,682 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:28,703 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-28 06:02:28,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:28,883 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:28,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2021-12-28 06:02:28,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:28,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747950935] [2021-12-28 06:02:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:28,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747950935] [2021-12-28 06:02:28,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747950935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:28,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:28,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:28,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963017648] [2021-12-28 06:02:28,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:28,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:28,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:28,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:28,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:28,933 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,089 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2021-12-28 06:02:29,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:29,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-28 06:02:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,090 INFO L225 Difference]: With dead ends: 95 [2021-12-28 06:02:29,090 INFO L226 Difference]: Without dead ends: 95 [2021-12-28 06:02:29,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:29,092 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 156 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 181 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-12-28 06:02:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 67. [2021-12-28 06:02:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 66 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2021-12-28 06:02:29,094 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 23 [2021-12-28 06:02:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,094 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2021-12-28 06:02:29,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2021-12-28 06:02:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:29,095 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,095 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 06:02:29,095 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2021-12-28 06:02:29,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573509364] [2021-12-28 06:02:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573509364] [2021-12-28 06:02:29,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573509364] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:29,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521406515] [2021-12-28 06:02:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:29,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:29,190 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,349 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2021-12-28 06:02:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 06:02:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,350 INFO L225 Difference]: With dead ends: 90 [2021-12-28 06:02:29,350 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 06:02:29,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:29,351 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 282 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 132 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 06:02:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2021-12-28 06:02:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 66 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-28 06:02:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2021-12-28 06:02:29,353 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 23 [2021-12-28 06:02:29,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,353 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2021-12-28 06:02:29,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2021-12-28 06:02:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:29,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 06:02:29,354 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1033118353, now seen corresponding path program 1 times [2021-12-28 06:02:29,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388532148] [2021-12-28 06:02:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388532148] [2021-12-28 06:02:29,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388532148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:29,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827043178] [2021-12-28 06:02:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:29,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:29,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:29,399 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,500 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-28 06:02:29,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:29,500 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 06:02:29,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,501 INFO L225 Difference]: With dead ends: 66 [2021-12-28 06:02:29,501 INFO L226 Difference]: Without dead ends: 66 [2021-12-28 06:02:29,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:29,501 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 224 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 82 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-28 06:02:29,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-12-28 06:02:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-12-28 06:02:29,503 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2021-12-28 06:02:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,503 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-12-28 06:02:29,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-12-28 06:02:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 06:02:29,504 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,504 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 06:02:29,505 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:29,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1961897973, now seen corresponding path program 1 times [2021-12-28 06:02:29,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429499000] [2021-12-28 06:02:29,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429499000] [2021-12-28 06:02:29,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429499000] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:29,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590641622] [2021-12-28 06:02:29,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 06:02:29,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 06:02:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:29,564 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,698 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2021-12-28 06:02:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:02:29,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-28 06:02:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,698 INFO L225 Difference]: With dead ends: 87 [2021-12-28 06:02:29,698 INFO L226 Difference]: Without dead ends: 87 [2021-12-28 06:02:29,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:29,699 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 260 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 125 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-28 06:02:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 70. [2021-12-28 06:02:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-28 06:02:29,701 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 27 [2021-12-28 06:02:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,701 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-28 06:02:29,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-28 06:02:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 06:02:29,702 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,702 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 06:02:29,703 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:29,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328922, now seen corresponding path program 1 times [2021-12-28 06:02:29,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506869334] [2021-12-28 06:02:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:29,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506869334] [2021-12-28 06:02:29,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506869334] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 06:02:29,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230871307] [2021-12-28 06:02:29,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:29,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:29,746 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,819 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-12-28 06:02:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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-28 06:02:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,820 INFO L225 Difference]: With dead ends: 70 [2021-12-28 06:02:29,820 INFO L226 Difference]: Without dead ends: 70 [2021-12-28 06:02:29,820 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-28 06:02:29,820 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 115 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-28 06:02:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2021-12-28 06:02:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-12-28 06:02:29,822 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 27 [2021-12-28 06:02:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,823 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-12-28 06:02:29,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-12-28 06:02:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 06:02:29,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,823 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 06:02:29,824 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1962328923, now seen corresponding path program 1 times [2021-12-28 06:02:29,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320319369] [2021-12-28 06:02:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320319369] [2021-12-28 06:02:29,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320319369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 06:02:29,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819173488] [2021-12-28 06:02:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 06:02:29,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 06:02:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:29,955 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:30,243 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2021-12-28 06:02:30,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 06:02:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-28 06:02:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:30,244 INFO L225 Difference]: With dead ends: 106 [2021-12-28 06:02:30,244 INFO L226 Difference]: Without dead ends: 106 [2021-12-28 06:02:30,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-12-28 06:02:30,245 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 317 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:30,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 184 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:02:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-28 06:02:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2021-12-28 06:02:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.4) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-28 06:02:30,247 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 27 [2021-12-28 06:02:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:30,247 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-28 06:02:30,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-28 06:02:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:02:30,248 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:30,248 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:30,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 06:02:30,249 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:30,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash 689295123, now seen corresponding path program 1 times [2021-12-28 06:02:30,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:30,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741579819] [2021-12-28 06:02:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:30,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:30,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741579819] [2021-12-28 06:02:30,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741579819] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:30,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:30,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:02:30,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796448472] [2021-12-28 06:02:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:30,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:30,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:30,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:30,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:30,282 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:30,334 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2021-12-28 06:02:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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-28 06:02:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:30,335 INFO L225 Difference]: With dead ends: 75 [2021-12-28 06:02:30,335 INFO L226 Difference]: Without dead ends: 75 [2021-12-28 06:02:30,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:30,335 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:30,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 113 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-28 06:02:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-28 06:02:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 74 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-28 06:02:30,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-12-28 06:02:30,337 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 28 [2021-12-28 06:02:30,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:30,337 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-12-28 06:02:30,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,338 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-12-28 06:02:30,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:02:30,338 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:30,338 INFO L514 BasicCegarLoop]: trace histogram [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-28 06:02:30,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 06:02:30,338 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:30,339 INFO L85 PathProgramCache]: Analyzing trace with hash -106687560, now seen corresponding path program 1 times [2021-12-28 06:02:30,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:30,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541954229] [2021-12-28 06:02:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:30,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541954229] [2021-12-28 06:02:30,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541954229] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:30,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923241750] [2021-12-28 06:02:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:30,427 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-28 06:02:30,447 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-28 06:02:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 06:02:30,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:30,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:30,621 INFO L387 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-28 06:02:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:30,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:30,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923241750] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:30,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:30,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2021-12-28 06:02:30,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145862376] [2021-12-28 06:02:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:30,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:30,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:30,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:30,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-12-28 06:02:30,626 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) 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-28 06:02:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:30,694 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2021-12-28 06:02:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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 29 [2021-12-28 06:02:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:30,695 INFO L225 Difference]: With dead ends: 82 [2021-12-28 06:02:30,695 INFO L226 Difference]: Without dead ends: 82 [2021-12-28 06:02:30,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2021-12-28 06:02:30,696 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 122 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:30,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-28 06:02:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 74. [2021-12-28 06:02:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2021-12-28 06:02:30,698 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 29 [2021-12-28 06:02:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:30,698 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2021-12-28 06:02:30,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) 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-28 06:02:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2021-12-28 06:02:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:02:30,698 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:30,699 INFO L514 BasicCegarLoop]: trace histogram [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-28 06:02:30,718 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-28 06:02:30,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:30,911 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:30,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:30,912 INFO L85 PathProgramCache]: Analyzing trace with hash 307453124, now seen corresponding path program 1 times [2021-12-28 06:02:30,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:30,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858744184] [2021-12-28 06:02:30,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:31,058 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:31,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858744184] [2021-12-28 06:02:31,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858744184] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:31,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:31,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 06:02:31,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727613186] [2021-12-28 06:02:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:31,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 06:02:31,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:31,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 06:02:31,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:31,060 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:31,330 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-28 06:02:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 06:02:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-28 06:02:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:31,331 INFO L225 Difference]: With dead ends: 77 [2021-12-28 06:02:31,331 INFO L226 Difference]: Without dead ends: 77 [2021-12-28 06:02:31,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2021-12-28 06:02:31,332 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 224 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:31,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 183 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-28 06:02:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2021-12-28 06:02:31,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2021-12-28 06:02:31,334 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 29 [2021-12-28 06:02:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:31,334 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2021-12-28 06:02:31,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:31,334 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2021-12-28 06:02:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:02:31,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:31,334 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 06:02:31,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 06:02:31,334 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -890236208, now seen corresponding path program 1 times [2021-12-28 06:02:31,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:31,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528794974] [2021-12-28 06:02:31,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:31,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:31,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528794974] [2021-12-28 06:02:31,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528794974] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235098891] [2021-12-28 06:02:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:31,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:31,520 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-28 06:02:31,521 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-28 06:02:31,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:31,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-28 06:02:31,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:31,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:31,736 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:31,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:31,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:31,795 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:31,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:31,818 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:31,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 06:02:31,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2021-12-28 06:02:32,086 INFO L353 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-12-28 06:02:32,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2021-12-28 06:02:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:32,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:32,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-28 06:02:32,351 INFO L353 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2021-12-28 06:02:32,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-12-28 06:02:32,356 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-28 06:02:32,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2021-12-28 06:02:32,402 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:32,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2021-12-28 06:02:32,434 INFO L353 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2021-12-28 06:02:32,435 INFO L387 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 6 case distinctions, treesize of input 123 treesize of output 124 [2021-12-28 06:02:32,442 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:32,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 104 [2021-12-28 06:02:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:32,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235098891] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:32,600 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:32,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2021-12-28 06:02:32,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873731335] [2021-12-28 06:02:32,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:32,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-28 06:02:32,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-28 06:02:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1299, Unknown=2, NotChecked=146, Total=1560 [2021-12-28 06:02:32,602 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 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-28 06:02:32,728 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1197 Int) (v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1197)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1)) (= (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-28 06:02:32,731 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2021-12-28 06:02:32,734 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1200 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1200))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2021-12-28 06:02:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:33,562 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2021-12-28 06:02:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 06:02:33,563 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 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 31 [2021-12-28 06:02:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:33,563 INFO L225 Difference]: With dead ends: 154 [2021-12-28 06:02:33,563 INFO L226 Difference]: Without dead ends: 154 [2021-12-28 06:02:33,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=2274, Unknown=5, NotChecked=510, Total=3080 [2021-12-28 06:02:33,564 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 299 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:33,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 759 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1184 Invalid, 0 Unknown, 566 Unchecked, 0.4s Time] [2021-12-28 06:02:33,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-28 06:02:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 94. [2021-12-28 06:02:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.275) internal successors, (102), 93 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-12-28 06:02:33,567 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 31 [2021-12-28 06:02:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:33,567 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-12-28 06:02:33,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.2051282051282053) internal successors, (86), 40 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-28 06:02:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-12-28 06:02:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:02:33,567 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:33,567 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 06:02:33,587 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-28 06:02:33,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:33,779 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:33,780 INFO L85 PathProgramCache]: Analyzing trace with hash -890236207, now seen corresponding path program 1 times [2021-12-28 06:02:33,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:33,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661706417] [2021-12-28 06:02:33,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:33,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:34,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:34,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661706417] [2021-12-28 06:02:34,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661706417] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:34,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286299097] [2021-12-28 06:02:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:34,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:34,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:34,083 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-28 06:02:34,085 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-28 06:02:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:34,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-28 06:02:34,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:34,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:34,328 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:34,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:34,370 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:34,374 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:34,431 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:34,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:34,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:34,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:34,471 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:34,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-28 06:02:34,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2021-12-28 06:02:34,832 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-28 06:02:34,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2021-12-28 06:02:34,840 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-28 06:02:34,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2021-12-28 06:02:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:34,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:35,281 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:35,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 94 [2021-12-28 06:02:35,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse0 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse4 (+ .cse1 4))) (let ((.cse2 (select (select .cse5 .cse0) .cse4))) (and (<= .cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse3 .cse0) .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse2 4))))))))) is different from false [2021-12-28 06:02:35,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse6 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse3 (+ .cse5 4))) (let ((.cse1 (select (select .cse4 .cse0) .cse3))) (and (<= .cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (<= 0 (+ .cse1 4)) (= (select (select .cse2 .cse0) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) is different from false [2021-12-28 06:02:35,696 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:35,700 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:35,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 245 treesize of output 190 [2021-12-28 06:02:35,704 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:35,708 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:35,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 185 treesize of output 115 [2021-12-28 06:02:35,749 INFO L353 Elim1Store]: treesize reduction 30, result has 67.0 percent of original size [2021-12-28 06:02:35,749 INFO L387 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 6 case distinctions, treesize of input 267 treesize of output 266 [2021-12-28 06:02:35,893 INFO L353 Elim1Store]: treesize reduction 156, result has 42.9 percent of original size [2021-12-28 06:02:35,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 580 treesize of output 572 [2021-12-28 06:02:35,937 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:35,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 472 treesize of output 454 [2021-12-28 06:02:35,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:35,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 460 treesize of output 442 [2021-12-28 06:02:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:39,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286299097] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:39,703 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:39,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 43 [2021-12-28 06:02:39,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181325103] [2021-12-28 06:02:39,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:39,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-28 06:02:39,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-28 06:02:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1606, Unknown=2, NotChecked=162, Total=1892 [2021-12-28 06:02:39,705 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:39,899 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse9 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and .cse0 (<= .cse1 12) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_ArrVal_1306 (Array Int Int)) (v_ArrVal_1303 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1302 Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_1302)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse8 v_ArrVal_1303)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse2 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse5 (+ .cse7 4))) (let ((.cse3 (select (select .cse6 .cse2) .cse5))) (and (<= .cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (<= 0 (+ .cse3 4)) (= (select (select .cse4 .cse2) .cse5) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) .cse9 (= .cse10 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse10) (or (and .cse9 (<= 12 .cse1)) (and .cse0 (<= .cse1 11))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2021-12-28 06:02:39,902 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (= .cse2 0) (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse7 (+ .cse4 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse7))) (and (<= .cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse6 .cse3) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse5 4))))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse9 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse9)) (and .cse0 (<= .cse9 11))))))) is different from false [2021-12-28 06:02:39,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10)) (.cse1 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse10) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= .cse2 0) (forall ((v_ArrVal_1306 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1308 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1306)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1308))) (let ((.cse3 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (let ((.cse7 (+ .cse4 4))) (let ((.cse5 (select (select .cse8 .cse3) .cse7))) (and (<= .cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (= (select (select .cse6 .cse3) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (<= 0 (+ .cse5 4))))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse2) (let ((.cse9 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and .cse1 (<= 12 .cse9)) (and .cse0 (<= .cse9 11))))))) is different from false [2021-12-28 06:02:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:41,537 INFO L93 Difference]: Finished difference Result 269 states and 287 transitions. [2021-12-28 06:02:41,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-28 06:02:41,538 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-28 06:02:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:41,539 INFO L225 Difference]: With dead ends: 269 [2021-12-28 06:02:41,539 INFO L226 Difference]: Without dead ends: 269 [2021-12-28 06:02:41,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=355, Invalid=3200, Unknown=5, NotChecked=600, Total=4160 [2021-12-28 06:02:41,541 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 572 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 748 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:41,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 1412 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1638 Invalid, 0 Unknown, 748 Unchecked, 0.8s Time] [2021-12-28 06:02:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-28 06:02:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 94. [2021-12-28 06:02:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 93 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2021-12-28 06:02:41,545 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 31 [2021-12-28 06:02:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:41,545 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2021-12-28 06:02:41,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.046511627906977) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,546 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2021-12-28 06:02:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 06:02:41,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:41,546 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 06:02:41,570 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-28 06:02:41,763 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,SelfDestructingSolverStorable21 [2021-12-28 06:02:41,763 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1649773349, now seen corresponding path program 1 times [2021-12-28 06:02:41,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227793694] [2021-12-28 06:02:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:41,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:41,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:41,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227793694] [2021-12-28 06:02:41,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227793694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:41,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:41,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:41,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657341867] [2021-12-28 06:02:41,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:41,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:41,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:41,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:41,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:41,797 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:41,840 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2021-12-28 06:02:41,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 06:02:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:41,841 INFO L225 Difference]: With dead ends: 99 [2021-12-28 06:02:41,841 INFO L226 Difference]: Without dead ends: 99 [2021-12-28 06:02:41,841 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-28 06:02:41,844 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 74 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:41,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-28 06:02:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-12-28 06:02:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2021-12-28 06:02:41,846 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 33 [2021-12-28 06:02:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:41,847 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2021-12-28 06:02:41,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2021-12-28 06:02:41,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 06:02:41,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:41,847 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, 1] [2021-12-28 06:02:41,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 06:02:41,848 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:41,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:41,848 INFO L85 PathProgramCache]: Analyzing trace with hash -818501958, now seen corresponding path program 1 times [2021-12-28 06:02:41,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:41,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680377210] [2021-12-28 06:02:41,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:41,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:41,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:41,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680377210] [2021-12-28 06:02:41,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680377210] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:41,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713288820] [2021-12-28 06:02:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:41,887 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:41,888 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-28 06:02:41,889 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-28 06:02:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:42,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-28 06:02:42,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:42,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 06:02:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:42,080 INFO L353 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-28 06:02:42,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2021-12-28 06:02:42,103 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:42,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713288820] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:42,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:42,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2021-12-28 06:02:42,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232522431] [2021-12-28 06:02:42,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:42,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:42,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:42,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:42,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:42,105 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:42,202 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2021-12-28 06:02:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:02:42,202 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 06:02:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:42,203 INFO L225 Difference]: With dead ends: 99 [2021-12-28 06:02:42,203 INFO L226 Difference]: Without dead ends: 99 [2021-12-28 06:02:42,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-12-28 06:02:42,203 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 35 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:42,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 130 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-28 06:02:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-12-28 06:02:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.255813953488372) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2021-12-28 06:02:42,205 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 33 [2021-12-28 06:02:42,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:42,205 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2021-12-28 06:02:42,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2021-12-28 06:02:42,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 06:02:42,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:42,206 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, 1] [2021-12-28 06:02:42,228 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-28 06:02:42,406 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,SelfDestructingSolverStorable23 [2021-12-28 06:02:42,406 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:42,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash -818501957, now seen corresponding path program 1 times [2021-12-28 06:02:42,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:42,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865278003] [2021-12-28 06:02:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:42,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:42,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865278003] [2021-12-28 06:02:42,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865278003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705179872] [2021-12-28 06:02:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:42,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:42,537 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-28 06:02:42,538 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-28 06:02:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:42,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 06:02:42,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:42,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-12-28 06:02:42,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-28 06:02:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:42,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:42,880 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:42,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2021-12-28 06:02:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:42,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705179872] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:42,927 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:42,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2021-12-28 06:02:42,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027219905] [2021-12-28 06:02:42,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:42,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-28 06:02:42,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:42,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-28 06:02:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2021-12-28 06:02:42,929 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:43,725 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2021-12-28 06:02:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-28 06:02:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 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-28 06:02:43,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:43,726 INFO L225 Difference]: With dead ends: 135 [2021-12-28 06:02:43,726 INFO L226 Difference]: Without dead ends: 135 [2021-12-28 06:02:43,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=383, Invalid=1423, Unknown=0, NotChecked=0, Total=1806 [2021-12-28 06:02:43,727 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 411 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:43,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 231 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 06:02:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-28 06:02:43,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 97. [2021-12-28 06:02:43,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2021-12-28 06:02:43,730 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 33 [2021-12-28 06:02:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:43,730 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2021-12-28 06:02:43,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2021-12-28 06:02:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:02:43,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:43,731 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 06:02:43,759 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-28 06:02:43,945 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,SelfDestructingSolverStorable24 [2021-12-28 06:02:43,945 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:43,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 396633763, now seen corresponding path program 1 times [2021-12-28 06:02:43,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:43,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153431863] [2021-12-28 06:02:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:43,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:44,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:44,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153431863] [2021-12-28 06:02:44,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153431863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334754017] [2021-12-28 06:02:44,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:44,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:44,476 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-28 06:02:44,477 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-28 06:02:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:44,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-28 06:02:44,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:44,660 INFO L387 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-28 06:02:44,758 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:44,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:44,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:44,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-28 06:02:44,896 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:44,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-28 06:02:45,154 INFO L353 Elim1Store]: treesize reduction 6, result has 83.8 percent of original size [2021-12-28 06:02:45,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 48 [2021-12-28 06:02:45,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-28 06:02:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:45,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:45,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-28 06:02:45,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-28 06:02:45,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2021-12-28 06:02:45,617 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:45,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 50 [2021-12-28 06:02:45,645 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:45,646 INFO L387 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 6 case distinctions, treesize of input 111 treesize of output 158 [2021-12-28 06:02:45,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:45,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 105 [2021-12-28 06:02:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:46,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334754017] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:46,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:46,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 16] total 50 [2021-12-28 06:02:46,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114922442] [2021-12-28 06:02:46,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:46,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-28 06:02:46,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:46,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-28 06:02:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2115, Unknown=2, NotChecked=186, Total=2450 [2021-12-28 06:02:46,799 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:47,047 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse2 (= .cse0 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (not (= (select (select .cse4 .cse3) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= .cse1 0))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2021-12-28 06:02:47,051 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse5)) (.cse0 (select |c_#valid| 0)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= .cse0 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2 .cse3) 4) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= .cse0 1)) (= (select .cse4 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse5 (not (= (select .cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2021-12-28 06:02:47,055 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2021-12-28 06:02:48,093 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse1 (= (select |c_#valid| 0) 1)) (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1669 Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1669)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (not (= (select (select .cse3 .cse2) 4) 0)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= .cse0 0)))))) is different from false [2021-12-28 06:02:48,113 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse0 (forall ((v_ArrVal_1671 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1671))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or .cse0 (= (select |c_#valid| 0) 1)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (or .cse4 (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))))) is different from false [2021-12-28 06:02:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:48,401 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2021-12-28 06:02:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-28 06:02:48,402 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 06:02:48,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:48,402 INFO L225 Difference]: With dead ends: 125 [2021-12-28 06:02:48,402 INFO L226 Difference]: Without dead ends: 123 [2021-12-28 06:02:48,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=3999, Unknown=7, NotChecked=952, Total=5402 [2021-12-28 06:02:48,404 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 353 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:48,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 951 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1172 Invalid, 0 Unknown, 369 Unchecked, 0.6s Time] [2021-12-28 06:02:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-28 06:02:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 97. [2021-12-28 06:02:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2021-12-28 06:02:48,408 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 34 [2021-12-28 06:02:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:48,408 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2021-12-28 06:02:48,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.84) internal successors, (92), 50 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2021-12-28 06:02:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:02:48,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:48,409 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, 1, 1, 1] [2021-12-28 06:02:48,436 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-28 06:02:48,623 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,SelfDestructingSolverStorable25 [2021-12-28 06:02:48,624 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash -601364006, now seen corresponding path program 1 times [2021-12-28 06:02:48,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:48,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086952647] [2021-12-28 06:02:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:48,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:48,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086952647] [2021-12-28 06:02:48,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086952647] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968335671] [2021-12-28 06:02:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:48,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:48,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:48,900 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-28 06:02:48,903 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-28 06:02:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:49,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-28 06:02:49,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:49,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:49,164 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:49,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:49,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:49,243 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:49,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:49,269 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:49,270 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-28 06:02:49,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2021-12-28 06:02:49,606 INFO L353 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-12-28 06:02:49,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 25 [2021-12-28 06:02:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:49,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:49,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-12-28 06:02:49,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2021-12-28 06:02:49,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) is different from false [2021-12-28 06:02:49,922 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:49,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 53 [2021-12-28 06:02:49,966 INFO L353 Elim1Store]: treesize reduction 23, result has 67.1 percent of original size [2021-12-28 06:02:49,967 INFO L387 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 6 case distinctions, treesize of input 129 treesize of output 143 [2021-12-28 06:02:49,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:49,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 110 [2021-12-28 06:02:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:50,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968335671] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:50,292 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:50,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 40 [2021-12-28 06:02:50,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88113115] [2021-12-28 06:02:50,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:50,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-28 06:02:50,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:50,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-28 06:02:50,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1368, Unknown=2, NotChecked=150, Total=1640 [2021-12-28 06:02:50,296 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:50,437 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1784 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1784)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2021-12-28 06:02:50,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2021-12-28 06:02:50,442 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1785 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1785))) (let ((.cse1 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ (select (select .cse2 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|))) is different from false [2021-12-28 06:02:51,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:51,449 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2021-12-28 06:02:51,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-28 06:02:51,450 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-28 06:02:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:51,451 INFO L225 Difference]: With dead ends: 167 [2021-12-28 06:02:51,451 INFO L226 Difference]: Without dead ends: 167 [2021-12-28 06:02:51,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=315, Invalid=2456, Unknown=5, NotChecked=530, Total=3306 [2021-12-28 06:02:51,452 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 360 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:51,453 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 884 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 771 Invalid, 0 Unknown, 515 Unchecked, 0.4s Time] [2021-12-28 06:02:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-28 06:02:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 98. [2021-12-28 06:02:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:51,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-28 06:02:51,456 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 35 [2021-12-28 06:02:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:51,456 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-28 06:02:51,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.175) internal successors, (87), 41 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:51,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-28 06:02:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 06:02:51,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:51,457 INFO L514 BasicCegarLoop]: trace histogram [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-28 06:02:51,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-28 06:02:51,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:51,676 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 30 more)] === [2021-12-28 06:02:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash -601311418, now seen corresponding path program 2 times [2021-12-28 06:02:51,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:51,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312219363] [2021-12-28 06:02:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:51,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:52,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:52,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312219363] [2021-12-28 06:02:52,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312219363] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:52,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421003046] [2021-12-28 06:02:52,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:52,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:52,220 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-28 06:02:52,220 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-28 06:02:52,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:02:52,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:52,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 100 conjunts are in the unsatisfiable core [2021-12-28 06:02:52,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:52,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 06:02:52,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:52,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-28 06:02:52,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,519 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:52,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-28 06:02:52,588 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:52,589 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:02:52,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-28 06:02:52,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-28 06:02:52,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 06:02:52,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 06:02:52,760 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:52,760 INFO L387 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 30 treesize of output 32 [2021-12-28 06:02:52,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,771 INFO L387 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 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-28 06:02:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:52,812 INFO L353 Elim1Store]: treesize reduction 61, result has 12.9 percent of original size [2021-12-28 06:02:52,812 INFO L387 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 68 [2021-12-28 06:02:52,840 INFO L353 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2021-12-28 06:02:52,840 INFO L387 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 62 [2021-12-28 06:02:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:53,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:55,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1904)))) (let ((.cse6 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse5 (+ 4 .cse6))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (+ (select (select .cse0 .cse4) .cse5) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4))))))) is different from false [2021-12-28 06:02:57,664 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse9 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse3 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 v_ArrVal_1898)))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_1904)))) (.cse0 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 v_ArrVal_1900)))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse4 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse5 (+ .cse6 4))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (+ (select (select .cse3 .cse4) .cse5) 4))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6))))))) is different from false [2021-12-28 06:02:59,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_create_~new_head~0#1.offset| Int) (v_ArrVal_1904 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1898 Int) (v_ArrVal_1900 Int)) (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse9 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse10 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse0 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) .cse10 v_ArrVal_1898)))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 v_ArrVal_1904)))) (.cse3 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10 v_ArrVal_1900)))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse5 (+ .cse6 4))) (let ((.cse1 (select (select .cse3 .cse4) .cse5)) (.cse2 (+ 4 (select (select .cse0 .cse4) .cse5)))) (and (= (select (select .cse0 .cse1) .cse2) 0) (= (select (select .cse3 .cse1) .cse2) 0)))) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse6 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) is different from false [2021-12-28 06:02:59,871 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:59,883 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:59,883 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 624 treesize of output 480 [2021-12-28 06:02:59,888 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:59,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:59,897 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 1124 treesize of output 380 [2021-12-28 06:03:00,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1904 Int) (v_arrayElimArr_7 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse2 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_1904)))) (.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse1 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_6 .cse0))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_7 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (let ((.cse3 (select (select .cse5 .cse1) .cse0)) (.cse4 (+ (select (select .cse2 .cse1) .cse0) 4))) (and (= 0 (select (select .cse2 .cse3) .cse4)) (= (select (select .cse5 .cse3) .cse4) 0)))))))) is different from false [2021-12-28 06:03:03,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_ArrVal_1904 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1890 Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1889 Int)) (let ((.cse7 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse1 (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1889)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_6))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1904)))) (.cse4 (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 v_ArrVal_1890)) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| v_arrayElimArr_7))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7 |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|))))) (let ((.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select v_arrayElimArr_7 .cse0))) (let ((.cse2 (select (select .cse4 .cse5) .cse0)) (.cse3 (+ (select (select .cse1 .cse5) .cse0) 4))) (and (= (select (select .cse1 .cse2) .cse3) 0) (= (select (select .cse4 .cse2) .cse3) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38|) 0)) (not (= |v_ULTIMATE.start_dll_create_~new_head~0#1.base_38| .cse5)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (select v_arrayElimArr_6 .cse0)))))))) is different from false [2021-12-28 06:03:03,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:03,109 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:03,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 836 treesize of output 586 [2021-12-28 06:03:03,121 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:03,128 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:03,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 564 treesize of output 344 [2021-12-28 06:03:03,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:03,364 INFO L353 Elim1Store]: treesize reduction 231, result has 60.6 percent of original size [2021-12-28 06:03:03,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 13464 treesize of output 12345