./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 13:04:27,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 13:04:27,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 13:04:27,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 13:04:27,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 13:04:27,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 13:04:27,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 13:04:27,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 13:04:27,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 13:04:27,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 13:04:27,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 13:04:27,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 13:04:27,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 13:04:27,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 13:04:27,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 13:04:27,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 13:04:27,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 13:04:27,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 13:04:27,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 13:04:27,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 13:04:27,350 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 13:04:27,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 13:04:27,351 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 13:04:27,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 13:04:27,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 13:04:27,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 13:04:27,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 13:04:27,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 13:04:27,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 13:04:27,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 13:04:27,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 13:04:27,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 13:04:27,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 13:04:27,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 13:04:27,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 13:04:27,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 13:04:27,358 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 13:04:27,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 13:04:27,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 13:04:27,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 13:04:27,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 13:04:27,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 13:04:27,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 13:04:27,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 13:04:27,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 13:04:27,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 13:04:27,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 13:04:27,389 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 13:04:27,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 13:04:27,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 13:04:27,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 13:04:27,389 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 13:04:27,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 13:04:27,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 13:04:27,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 13:04:27,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 13:04:27,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 13:04:27,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 13:04:27,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 13:04:27,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 13:04:27,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 13:04:27,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 13:04:27,392 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 13:04:27,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 13:04:27,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:04:27,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 13:04:27,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 13:04:27,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 13:04:27,394 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b83c28af83745ba79af1b1ebec4b495db7aa2efb3702685bbdc4b86421ef4c0a [2022-07-12 13:04:27,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 13:04:27,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 13:04:27,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 13:04:27,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 13:04:27,563 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 13:04:27,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:04:27,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfaf92144/66931b57f2da436ab0ad99bdca90a7c8/FLAG1d88baec9 [2022-07-12 13:04:28,156 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 13:04:28,157 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:04:28,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfaf92144/66931b57f2da436ab0ad99bdca90a7c8/FLAG1d88baec9 [2022-07-12 13:04:28,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfaf92144/66931b57f2da436ab0ad99bdca90a7c8 [2022-07-12 13:04:28,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 13:04:28,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 13:04:28,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 13:04:28,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 13:04:28,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 13:04:28,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:04:28" (1/1) ... [2022-07-12 13:04:28,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9b2449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:28, skipping insertion in model container [2022-07-12 13:04:28,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 01:04:28" (1/1) ... [2022-07-12 13:04:28,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 13:04:28,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 13:04:29,421 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/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-07-12 13:04:29,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:04:29,456 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 13:04:29,638 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/ldv-validator-v0.8/linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i[216887,216900] [2022-07-12 13:04:29,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 13:04:29,722 INFO L208 MainTranslator]: Completed translation [2022-07-12 13:04:29,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29 WrapperNode [2022-07-12 13:04:29,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 13:04:29,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 13:04:29,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 13:04:29,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 13:04:29,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,873 INFO L137 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3223 [2022-07-12 13:04:29,874 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 13:04:29,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 13:04:29,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 13:04:29,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 13:04:29,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:29,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:30,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:30,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 13:04:30,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 13:04:30,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 13:04:30,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 13:04:30,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (1/1) ... [2022-07-12 13:04:30,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 13:04:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:04:30,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 13:04:30,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 13:04:30,086 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-12 13:04:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-12 13:04:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-12 13:04:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-12 13:04:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 13:04:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 13:04:30,087 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-12 13:04:30,087 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 13:04:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 13:04:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 13:04:30,088 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 13:04:30,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 13:04:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 13:04:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 13:04:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-12 13:04:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-12 13:04:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 13:04:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 13:04:30,089 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 13:04:30,089 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 13:04:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 13:04:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 13:04:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 13:04:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 13:04:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-12 13:04:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-12 13:04:30,090 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 13:04:30,090 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 13:04:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-12 13:04:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-12 13:04:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 13:04:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 13:04:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 13:04:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 13:04:30,091 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 13:04:30,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-12 13:04:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-12 13:04:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 13:04:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 13:04:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 13:04:30,092 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 13:04:30,092 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-12 13:04:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-12 13:04:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 13:04:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-12 13:04:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-12 13:04:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-12 13:04:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-12 13:04:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-12 13:04:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-12 13:04:30,094 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-12 13:04:30,094 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-12 13:04:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 13:04:30,095 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 13:04:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-12 13:04:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-12 13:04:30,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-12 13:04:30,096 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-12 13:04:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-12 13:04:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 13:04:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 13:04:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-12 13:04:30,097 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-12 13:04:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 13:04:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 13:04:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 13:04:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 13:04:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 13:04:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 13:04:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 13:04:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-12 13:04:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-12 13:04:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-12 13:04:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-12 13:04:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 13:04:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-12 13:04:30,099 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-12 13:04:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 13:04:30,099 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-12 13:04:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-12 13:04:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 13:04:30,100 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 13:04:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-12 13:04:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-12 13:04:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 13:04:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 13:04:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-12 13:04:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-12 13:04:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-12 13:04:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-12 13:04:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-12 13:04:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-12 13:04:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 13:04:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 13:04:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 13:04:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 13:04:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 13:04:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 13:04:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-12 13:04:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-12 13:04:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 13:04:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-12 13:04:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-12 13:04:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-12 13:04:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-12 13:04:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-12 13:04:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-12 13:04:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 13:04:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 13:04:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 13:04:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-12 13:04:30,107 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-12 13:04:30,107 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-12 13:04:30,108 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-12 13:04:30,565 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 13:04:30,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 13:04:30,682 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 13:04:34,016 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 13:04:34,035 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 13:04:34,035 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 13:04:34,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:04:34 BoogieIcfgContainer [2022-07-12 13:04:34,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 13:04:34,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 13:04:34,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 13:04:34,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 13:04:34,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 01:04:28" (1/3) ... [2022-07-12 13:04:34,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8597f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:04:34, skipping insertion in model container [2022-07-12 13:04:34,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 01:04:29" (2/3) ... [2022-07-12 13:04:34,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8597f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 01:04:34, skipping insertion in model container [2022-07-12 13:04:34,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 01:04:34" (3/3) ... [2022-07-12 13:04:34,048 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1b0b0ac-1-108_1a-drivers--net--slip.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-12 13:04:34,060 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 13:04:34,061 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 13:04:34,124 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 13:04:34,128 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f32b99c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c0bbd52 [2022-07-12 13:04:34,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 13:04:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 1110 states, 820 states have (on average 1.425609756097561) internal successors, (1169), 852 states have internal predecessors, (1169), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) [2022-07-12 13:04:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 13:04:34,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:04:34,149 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:04:34,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:04:34,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:04:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484925, now seen corresponding path program 1 times [2022-07-12 13:04:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:04:34,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771571239] [2022-07-12 13:04:34,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:04:34,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:04:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:04:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:04:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:04:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:04:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:04:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:04:34,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:34,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:04:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:04:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:04:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:04:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:04:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:04:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:04:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:04:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-12 13:04:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:04:34,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771571239] [2022-07-12 13:04:34,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771571239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:04:34,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:04:34,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 13:04:34,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297891524] [2022-07-12 13:04:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:04:34,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 13:04:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:04:34,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 13:04:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 13:04:34,919 INFO L87 Difference]: Start difference. First operand has 1110 states, 820 states have (on average 1.425609756097561) internal successors, (1169), 852 states have internal predecessors, (1169), 236 states have call successors, (236), 53 states have call predecessors, (236), 52 states have return successors, (231), 229 states have call predecessors, (231), 231 states have call successors, (231) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:04:37,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:38,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:04:40,042 INFO L93 Difference]: Finished difference Result 2346 states and 3526 transitions. [2022-07-12 13:04:40,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 13:04:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2022-07-12 13:04:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:04:40,059 INFO L225 Difference]: With dead ends: 2346 [2022-07-12 13:04:40,059 INFO L226 Difference]: Without dead ends: 1198 [2022-07-12 13:04:40,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:04:40,068 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1208 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 3192 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-12 13:04:40,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 3192 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-12 13:04:40,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-07-12 13:04:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1068. [2022-07-12 13:04:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 791 states have (on average 1.413400758533502) internal successors, (1118), 815 states have internal predecessors, (1118), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2022-07-12 13:04:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1566 transitions. [2022-07-12 13:04:40,205 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1566 transitions. Word has length 161 [2022-07-12 13:04:40,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:04:40,205 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1566 transitions. [2022-07-12 13:04:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 13:04:40,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1566 transitions. [2022-07-12 13:04:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 13:04:40,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:04:40,212 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:04:40,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 13:04:40,213 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:04:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:04:40,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1068684857, now seen corresponding path program 1 times [2022-07-12 13:04:40,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:04:40,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105044102] [2022-07-12 13:04:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:04:40,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:04:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:04:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:04:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:04:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:04:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:04:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:04:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:04:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:04:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:04:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:04:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:04:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:04:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:04:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:04:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-12 13:04:40,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:04:40,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105044102] [2022-07-12 13:04:40,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105044102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:04:40,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:04:40,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:04:40,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260762724] [2022-07-12 13:04:40,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:04:40,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:04:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:04:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:04:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:04:40,544 INFO L87 Difference]: Start difference. First operand 1068 states and 1566 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 13:04:44,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:04:47,727 INFO L93 Difference]: Finished difference Result 2892 states and 4264 transitions. [2022-07-12 13:04:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:04:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 161 [2022-07-12 13:04:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:04:47,737 INFO L225 Difference]: With dead ends: 2892 [2022-07-12 13:04:47,737 INFO L226 Difference]: Without dead ends: 1860 [2022-07-12 13:04:47,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:04:47,742 INFO L413 NwaCegarLoop]: 1537 mSDtfsCounter, 2564 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 1272 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2702 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 3743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1272 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 13:04:47,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2702 Valid, 3837 Invalid, 3743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1272 Valid, 2470 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 13:04:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-12 13:04:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-12 13:04:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.397489539748954) internal successors, (1670), 1228 states have internal predecessors, (1670), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-12 13:04:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2352 transitions. [2022-07-12 13:04:47,813 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2352 transitions. Word has length 161 [2022-07-12 13:04:47,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:04:47,815 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2352 transitions. [2022-07-12 13:04:47,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 13:04:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2352 transitions. [2022-07-12 13:04:47,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-12 13:04:47,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:04:47,821 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:04:47,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 13:04:47,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:04:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:04:47,822 INFO L85 PathProgramCache]: Analyzing trace with hash -194454501, now seen corresponding path program 1 times [2022-07-12 13:04:47,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:04:47,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475085356] [2022-07-12 13:04:47,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:04:47,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:04:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:04:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:04:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:04:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:04:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:04:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:04:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:04:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:04:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:04:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:04:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:04:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:04:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:04:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:04:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:04:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:04:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 13:04:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-12 13:04:48,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:04:48,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475085356] [2022-07-12 13:04:48,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475085356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:04:48,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:04:48,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:04:48,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566718968] [2022-07-12 13:04:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:04:48,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:04:48,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:04:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:04:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:04:48,213 INFO L87 Difference]: Start difference. First operand 1628 states and 2352 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 13:04:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:04:50,536 INFO L93 Difference]: Finished difference Result 3442 states and 5039 transitions. [2022-07-12 13:04:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:04:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 222 [2022-07-12 13:04:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:04:50,545 INFO L225 Difference]: With dead ends: 3442 [2022-07-12 13:04:50,545 INFO L226 Difference]: Without dead ends: 1860 [2022-07-12 13:04:50,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:04:50,553 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 2869 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 1261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1261 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:04:50,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3010 Valid, 2533 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1261 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-12 13:04:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-12 13:04:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-12 13:04:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.39581589958159) internal successors, (1668), 1228 states have internal predecessors, (1668), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-12 13:04:50,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2350 transitions. [2022-07-12 13:04:50,614 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2350 transitions. Word has length 222 [2022-07-12 13:04:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:04:50,616 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2350 transitions. [2022-07-12 13:04:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-12 13:04:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2350 transitions. [2022-07-12 13:04:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-12 13:04:50,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:04:50,620 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:04:50,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 13:04:50,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:04:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:04:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1714003289, now seen corresponding path program 1 times [2022-07-12 13:04:50,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:04:50,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127399378] [2022-07-12 13:04:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:04:50,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:04:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:04:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:04:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:04:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:04:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:04:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:04:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:04:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:04:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:04:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:04:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:04:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:04:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:04:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:04:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:04:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 13:04:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 13:04:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:50,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-12 13:04:50,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:04:50,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127399378] [2022-07-12 13:04:50,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127399378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:04:50,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:04:50,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:04:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198776379] [2022-07-12 13:04:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:04:50,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:04:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:04:50,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:04:50,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:04:50,905 INFO L87 Difference]: Start difference. First operand 1628 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 13:04:54,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:04:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:04:56,752 INFO L93 Difference]: Finished difference Result 3446 states and 5039 transitions. [2022-07-12 13:04:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:04:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 222 [2022-07-12 13:04:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:04:56,762 INFO L225 Difference]: With dead ends: 3446 [2022-07-12 13:04:56,762 INFO L226 Difference]: Without dead ends: 1860 [2022-07-12 13:04:56,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:04:56,768 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 1205 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 654 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 4653 SdHoareTripleChecker+Invalid, 3582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-12 13:04:56,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 4653 Invalid, 3582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2927 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-07-12 13:04:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-12 13:04:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-12 13:04:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1195 states have (on average 1.3941422594142259) internal successors, (1666), 1228 states have internal predecessors, (1666), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-12 13:04:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2348 transitions. [2022-07-12 13:04:56,822 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2348 transitions. Word has length 222 [2022-07-12 13:04:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:04:56,823 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2348 transitions. [2022-07-12 13:04:56,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 13:04:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2348 transitions. [2022-07-12 13:04:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-12 13:04:56,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:04:56,828 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:04:56,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 13:04:56,829 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:04:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:04:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1427997940, now seen corresponding path program 1 times [2022-07-12 13:04:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:04:56,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012070922] [2022-07-12 13:04:56,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:04:56,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:04:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:04:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:04:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:04:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:04:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:04:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:04:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:04:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:04:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:04:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:04:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:04:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:04:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:04:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:04:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:04:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:04:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:04:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:04:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:04:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:04:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-12 13:04:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:04:57,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012070922] [2022-07-12 13:04:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012070922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:04:57,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:04:57,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:04:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850192692] [2022-07-12 13:04:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:04:57,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:04:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:04:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:04:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:04:57,171 INFO L87 Difference]: Start difference. First operand 1628 states and 2348 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 13:05:00,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:01,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:03,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:05,976 INFO L93 Difference]: Finished difference Result 2450 states and 3737 transitions. [2022-07-12 13:05:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 13:05:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 225 [2022-07-12 13:05:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:05,988 INFO L225 Difference]: With dead ends: 2450 [2022-07-12 13:05:05,989 INFO L226 Difference]: Without dead ends: 2448 [2022-07-12 13:05:05,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 13:05:05,990 INFO L413 NwaCegarLoop]: 2075 mSDtfsCounter, 1995 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 3422 mSolverCounterSat, 878 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 6693 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 3422 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:05,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2085 Valid, 6693 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 3422 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2022-07-12 13:05:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-12 13:05:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1630. [2022-07-12 13:05:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1197 states have (on average 1.3934837092731829) internal successors, (1668), 1230 states have internal predecessors, (1668), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-12 13:05:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2350 transitions. [2022-07-12 13:05:06,061 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2350 transitions. Word has length 225 [2022-07-12 13:05:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:06,061 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2350 transitions. [2022-07-12 13:05:06,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-07-12 13:05:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2350 transitions. [2022-07-12 13:05:06,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-12 13:05:06,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:06,066 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:06,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 13:05:06,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1191754029, now seen corresponding path program 1 times [2022-07-12 13:05:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:06,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998338995] [2022-07-12 13:05:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:06,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-12 13:05:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-12 13:05:06,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:06,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998338995] [2022-07-12 13:05:06,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998338995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:05:06,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:05:06,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:05:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482409365] [2022-07-12 13:05:06,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:05:06,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:05:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:05:06,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:05:06,393 INFO L87 Difference]: Start difference. First operand 1630 states and 2350 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 13:05:08,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:12,851 INFO L93 Difference]: Finished difference Result 4036 states and 6029 transitions. [2022-07-12 13:05:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:05:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 235 [2022-07-12 13:05:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:12,862 INFO L225 Difference]: With dead ends: 4036 [2022-07-12 13:05:12,863 INFO L226 Difference]: Without dead ends: 2452 [2022-07-12 13:05:12,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:05:12,868 INFO L413 NwaCegarLoop]: 1820 mSDtfsCounter, 2957 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 1169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3228 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1169 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:12,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3228 Valid, 5450 Invalid, 4624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1169 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 13:05:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-07-12 13:05:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1631. [2022-07-12 13:05:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1198 states have (on average 1.3931552587646077) internal successors, (1669), 1231 states have internal predecessors, (1669), 341 states have call successors, (341), 91 states have call predecessors, (341), 91 states have return successors, (341), 338 states have call predecessors, (341), 341 states have call successors, (341) [2022-07-12 13:05:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2351 transitions. [2022-07-12 13:05:12,934 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2351 transitions. Word has length 235 [2022-07-12 13:05:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:12,934 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2351 transitions. [2022-07-12 13:05:12,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-12 13:05:12,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2351 transitions. [2022-07-12 13:05:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-12 13:05:12,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:12,939 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:12,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 13:05:12,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1290014060, now seen corresponding path program 1 times [2022-07-12 13:05:12,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:12,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528149669] [2022-07-12 13:05:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:05:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-12 13:05:13,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:13,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528149669] [2022-07-12 13:05:13,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528149669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:05:13,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:05:13,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 13:05:13,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985411759] [2022-07-12 13:05:13,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:05:13,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 13:05:13,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:13,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 13:05:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:05:13,197 INFO L87 Difference]: Start difference. First operand 1631 states and 2351 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 13:05:16,437 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:18,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:20,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:24,679 INFO L93 Difference]: Finished difference Result 3383 states and 5318 transitions. [2022-07-12 13:05:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 13:05:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 237 [2022-07-12 13:05:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:24,715 INFO L225 Difference]: With dead ends: 3383 [2022-07-12 13:05:24,715 INFO L226 Difference]: Without dead ends: 3381 [2022-07-12 13:05:24,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:05:24,717 INFO L413 NwaCegarLoop]: 2506 mSDtfsCounter, 2807 mSDsluCounter, 8105 mSDsCounter, 0 mSdLazyCounter, 5764 mSolverCounterSat, 1211 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2995 SdHoareTripleChecker+Valid, 10611 SdHoareTripleChecker+Invalid, 6976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1211 IncrementalHoareTripleChecker+Valid, 5764 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:24,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2995 Valid, 10611 Invalid, 6976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1211 Valid, 5764 Invalid, 1 Unknown, 0 Unchecked, 11.2s Time] [2022-07-12 13:05:24,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-12 13:05:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 1633. [2022-07-12 13:05:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1199 states have (on average 1.3928273561301083) internal successors, (1670), 1231 states have internal predecessors, (1670), 342 states have call successors, (342), 91 states have call predecessors, (342), 91 states have return successors, (342), 339 states have call predecessors, (342), 342 states have call successors, (342) [2022-07-12 13:05:24,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2354 transitions. [2022-07-12 13:05:24,793 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2354 transitions. Word has length 237 [2022-07-12 13:05:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:24,794 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2354 transitions. [2022-07-12 13:05:24,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 13:05:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2354 transitions. [2022-07-12 13:05:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 13:05:24,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:24,801 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:24,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 13:05:24,801 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:24,802 INFO L85 PathProgramCache]: Analyzing trace with hash -278810711, now seen corresponding path program 1 times [2022-07-12 13:05:24,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:24,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132841086] [2022-07-12 13:05:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:05:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-12 13:05:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 13:05:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-12 13:05:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 13:05:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-12 13:05:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:25,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132841086] [2022-07-12 13:05:25,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132841086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:05:25,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:05:25,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:05:25,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723030062] [2022-07-12 13:05:25,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:05:25,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:05:25,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:05:25,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:05:25,091 INFO L87 Difference]: Start difference. First operand 1633 states and 2354 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 13:05:28,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:29,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:32,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:34,181 INFO L93 Difference]: Finished difference Result 4094 states and 5974 transitions. [2022-07-12 13:05:34,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:05:34,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 267 [2022-07-12 13:05:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:34,193 INFO L225 Difference]: With dead ends: 4094 [2022-07-12 13:05:34,194 INFO L226 Difference]: Without dead ends: 2507 [2022-07-12 13:05:34,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:05:34,198 INFO L413 NwaCegarLoop]: 2122 mSDtfsCounter, 2366 mSDsluCounter, 2585 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 1052 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:34,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2541 Valid, 4707 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 2443 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2022-07-12 13:05:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-07-12 13:05:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2168. [2022-07-12 13:05:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 1584 states have (on average 1.3869949494949494) internal successors, (2197), 1625 states have internal predecessors, (2197), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:05:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3109 transitions. [2022-07-12 13:05:34,306 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3109 transitions. Word has length 267 [2022-07-12 13:05:34,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:34,307 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 3109 transitions. [2022-07-12 13:05:34,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 13:05:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3109 transitions. [2022-07-12 13:05:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-12 13:05:34,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:34,316 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:34,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 13:05:34,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:34,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 245344003, now seen corresponding path program 1 times [2022-07-12 13:05:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:34,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472642904] [2022-07-12 13:05:34,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:05:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 13:05:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-12 13:05:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 13:05:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 13:05:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-12 13:05:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:34,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472642904] [2022-07-12 13:05:34,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472642904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:05:34,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:05:34,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:05:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720887051] [2022-07-12 13:05:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:05:34,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:05:34,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:34,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:05:34,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:05:34,617 INFO L87 Difference]: Start difference. First operand 2168 states and 3109 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 13:05:36,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:39,191 INFO L93 Difference]: Finished difference Result 4681 states and 6962 transitions. [2022-07-12 13:05:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 13:05:39,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 269 [2022-07-12 13:05:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:39,206 INFO L225 Difference]: With dead ends: 4681 [2022-07-12 13:05:39,206 INFO L226 Difference]: Without dead ends: 3094 [2022-07-12 13:05:39,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:05:39,212 INFO L413 NwaCegarLoop]: 1999 mSDtfsCounter, 3319 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 1393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1393 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:39,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 4539 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1393 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 13:05:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-12 13:05:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2172. [2022-07-12 13:05:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1588 states have (on average 1.3866498740554156) internal successors, (2202), 1629 states have internal predecessors, (2202), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:05:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3114 transitions. [2022-07-12 13:05:39,344 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3114 transitions. Word has length 269 [2022-07-12 13:05:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:39,344 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 3114 transitions. [2022-07-12 13:05:39,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 4 states have internal predecessors, (106), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-12 13:05:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3114 transitions. [2022-07-12 13:05:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-12 13:05:39,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:39,364 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:39,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 13:05:39,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:39,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1977117601, now seen corresponding path program 1 times [2022-07-12 13:05:39,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:39,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436022554] [2022-07-12 13:05:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:39,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:05:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 13:05:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 13:05:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-12 13:05:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-12 13:05:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2022-07-12 13:05:39,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:39,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436022554] [2022-07-12 13:05:39,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436022554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:05:39,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:05:39,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 13:05:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9673121] [2022-07-12 13:05:39,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:05:39,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 13:05:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 13:05:39,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 13:05:39,587 INFO L87 Difference]: Start difference. First operand 2172 states and 3114 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 13:05:41,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:44,824 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:05:46,426 INFO L93 Difference]: Finished difference Result 4635 states and 6767 transitions. [2022-07-12 13:05:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 13:05:46,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 272 [2022-07-12 13:05:46,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:05:46,449 INFO L225 Difference]: With dead ends: 4635 [2022-07-12 13:05:46,449 INFO L226 Difference]: Without dead ends: 2509 [2022-07-12 13:05:46,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-12 13:05:46,456 INFO L413 NwaCegarLoop]: 1460 mSDtfsCounter, 2056 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 1236 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1236 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 13:05:46,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 3318 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1236 Valid, 1620 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 13:05:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-12 13:05:46,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2172. [2022-07-12 13:05:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1588 states have (on average 1.3809823677581865) internal successors, (2193), 1629 states have internal predecessors, (2193), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:05:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3105 transitions. [2022-07-12 13:05:46,582 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3105 transitions. Word has length 272 [2022-07-12 13:05:46,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:05:46,584 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 3105 transitions. [2022-07-12 13:05:46,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (25), 5 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 13:05:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3105 transitions. [2022-07-12 13:05:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-12 13:05:46,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:05:46,592 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:05:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 13:05:46,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:05:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:05:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1130512862, now seen corresponding path program 1 times [2022-07-12 13:05:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:05:46,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337616794] [2022-07-12 13:05:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:46,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:05:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:05:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:05:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:05:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:05:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:05:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:05:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:05:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:05:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:05:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:05:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:05:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:05:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:05:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:05:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:05:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:05:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:05:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:05:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:05:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:05:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 13:05:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 13:05:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-12 13:05:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-12 13:05:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-12 13:05:46,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:05:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337616794] [2022-07-12 13:05:46,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337616794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:05:46,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360864286] [2022-07-12 13:05:46,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:05:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:05:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:05:46,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:05:46,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 13:05:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:05:47,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 13:05:47,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:05:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2022-07-12 13:05:47,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:05:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2022-07-12 13:05:48,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360864286] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 13:05:48,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 13:05:48,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2022-07-12 13:05:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984696476] [2022-07-12 13:05:48,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 13:05:48,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 13:05:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:05:48,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 13:05:48,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-12 13:05:48,041 INFO L87 Difference]: Start difference. First operand 2172 states and 3105 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-07-12 13:05:50,306 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:52,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:05:54,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:06:02,348 INFO L93 Difference]: Finished difference Result 6438 states and 9903 transitions. [2022-07-12 13:06:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 13:06:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 275 [2022-07-12 13:06:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:06:02,369 INFO L225 Difference]: With dead ends: 6438 [2022-07-12 13:06:02,369 INFO L226 Difference]: Without dead ends: 4847 [2022-07-12 13:06:02,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2022-07-12 13:06:02,375 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 5997 mSDsluCounter, 8971 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 3057 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6388 SdHoareTripleChecker+Valid, 11819 SdHoareTripleChecker+Invalid, 9321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3057 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-07-12 13:06:02,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6388 Valid, 11819 Invalid, 9321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3057 Valid, 6262 Invalid, 2 Unknown, 0 Unchecked, 13.8s Time] [2022-07-12 13:06:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2022-07-12 13:06:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 2179. [2022-07-12 13:06:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1595 states have (on average 1.380564263322884) internal successors, (2202), 1636 states have internal predecessors, (2202), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:06:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3114 transitions. [2022-07-12 13:06:02,549 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3114 transitions. Word has length 275 [2022-07-12 13:06:02,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:06:02,549 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 3114 transitions. [2022-07-12 13:06:02,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 10 states have internal predecessors, (221), 4 states have call successors, (70), 7 states have call predecessors, (70), 3 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2022-07-12 13:06:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3114 transitions. [2022-07-12 13:06:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-12 13:06:02,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:06:02,558 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:06:02,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 13:06:02,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 13:06:02,773 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:06:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:06:02,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1723971340, now seen corresponding path program 1 times [2022-07-12 13:06:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:06:02,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106994783] [2022-07-12 13:06:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:06:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:06:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:06:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:06:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:06:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:06:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:06:03,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:06:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:06:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:06:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:06:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:06:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:06:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:06:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:06:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:06:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:06:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:06:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:06:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-12 13:06:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-12 13:06:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 13:06:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 13:06:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-12 13:06:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-07-12 13:06:03,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:06:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106994783] [2022-07-12 13:06:03,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106994783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:06:03,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925017263] [2022-07-12 13:06:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:06:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:06:03,267 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:06:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 13:06:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:03,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 13:06:03,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:06:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-07-12 13:06:04,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 13:06:04,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925017263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:06:04,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 13:06:04,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-12 13:06:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184819095] [2022-07-12 13:06:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:06:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 13:06:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:06:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 13:06:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-12 13:06:04,015 INFO L87 Difference]: Start difference. First operand 2179 states and 3114 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 13:06:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:06:04,414 INFO L93 Difference]: Finished difference Result 4707 states and 6899 transitions. [2022-07-12 13:06:04,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 13:06:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 284 [2022-07-12 13:06:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:06:04,426 INFO L225 Difference]: With dead ends: 4707 [2022-07-12 13:06:04,427 INFO L226 Difference]: Without dead ends: 3109 [2022-07-12 13:06:04,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-12 13:06:04,432 INFO L413 NwaCegarLoop]: 2242 mSDtfsCounter, 894 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 5946 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 13:06:04,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 5946 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 13:06:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-07-12 13:06:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2181. [2022-07-12 13:06:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 1597 states have (on average 1.380087664370695) internal successors, (2204), 1638 states have internal predecessors, (2204), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:06:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3116 transitions. [2022-07-12 13:06:04,559 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3116 transitions. Word has length 284 [2022-07-12 13:06:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:06:04,560 INFO L495 AbstractCegarLoop]: Abstraction has 2181 states and 3116 transitions. [2022-07-12 13:06:04,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 13:06:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3116 transitions. [2022-07-12 13:06:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-12 13:06:04,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:06:04,568 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:06:04,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 13:06:04,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 13:06:04,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:06:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:06:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1388851498, now seen corresponding path program 1 times [2022-07-12 13:06:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:06:04,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739861676] [2022-07-12 13:06:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:06:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:06:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:06:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:06:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:06:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:06:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:06:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:06:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:06:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:06:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:06:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:06:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:06:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:06:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:06:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:06:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:06:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:06:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:06:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-12 13:06:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 13:06:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 13:06:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-12 13:06:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-12 13:06:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-12 13:06:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 13:06:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2022-07-12 13:06:05,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:06:05,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739861676] [2022-07-12 13:06:05,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739861676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:06:05,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:06:05,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 13:06:05,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526007590] [2022-07-12 13:06:05,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:06:05,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 13:06:05,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:06:05,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 13:06:05,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 13:06:05,065 INFO L87 Difference]: Start difference. First operand 2181 states and 3116 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 13:06:07,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:10,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:06:13,772 INFO L93 Difference]: Finished difference Result 4746 states and 7039 transitions. [2022-07-12 13:06:13,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 13:06:13,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 293 [2022-07-12 13:06:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:06:13,781 INFO L225 Difference]: With dead ends: 4746 [2022-07-12 13:06:13,781 INFO L226 Difference]: Without dead ends: 3146 [2022-07-12 13:06:13,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-12 13:06:13,789 INFO L413 NwaCegarLoop]: 1982 mSDtfsCounter, 2620 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 1411 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2752 SdHoareTripleChecker+Valid, 5129 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1411 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-12 13:06:13,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2752 Valid, 5129 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1411 Valid, 2699 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2022-07-12 13:06:13,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2022-07-12 13:06:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2183. [2022-07-12 13:06:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2183 states, 1599 states have (on average 1.3796122576610381) internal successors, (2206), 1640 states have internal predecessors, (2206), 456 states have call successors, (456), 128 states have call predecessors, (456), 127 states have return successors, (456), 450 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-12 13:06:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3118 transitions. [2022-07-12 13:06:13,924 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3118 transitions. Word has length 293 [2022-07-12 13:06:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:06:13,924 INFO L495 AbstractCegarLoop]: Abstraction has 2183 states and 3118 transitions. [2022-07-12 13:06:13,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 13:06:13,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3118 transitions. [2022-07-12 13:06:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-12 13:06:13,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:06:13,934 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:06:13,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 13:06:13,934 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:06:13,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:06:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -279572144, now seen corresponding path program 1 times [2022-07-12 13:06:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:06:13,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825376522] [2022-07-12 13:06:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:06:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:06:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:06:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:06:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:06:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:06:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:06:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:06:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:06:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:06:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:06:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:06:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:06:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:06:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:06:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:06:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 13:06:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 13:06:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 13:06:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-12 13:06:14,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-12 13:06:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 13:06:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 13:06:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 13:06:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 13:06:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-07-12 13:06:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-12 13:06:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2022-07-12 13:06:14,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:06:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825376522] [2022-07-12 13:06:14,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825376522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:06:14,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723445501] [2022-07-12 13:06:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:06:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:06:14,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:06:14,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 13:06:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:15,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 200 conjunts are in the unsatisfiable core [2022-07-12 13:06:15,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:06:16,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:06:16,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:06:16,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 13:06:16,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-07-12 13:06:16,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:06:16,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:06:16,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:06:16,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:06:16,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:06:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:06:16,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:06:16,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:16,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2022-07-12 13:06:17,008 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-12 13:06:17,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2022-07-12 13:06:17,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-07-12 13:06:17,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,070 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-07-12 13:06:17,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 52 [2022-07-12 13:06:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 32 [2022-07-12 13:06:17,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,286 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-12 13:06:17,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2022-07-12 13:06:17,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:06:17,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:06:17,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2022-07-12 13:06:17,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2022-07-12 13:06:17,335 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2022-07-12 13:06:17,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:06:17,660 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-07-12 13:06:17,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 58 [2022-07-12 13:06:17,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:17,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-07-12 13:06:18,027 INFO L356 Elim1Store]: treesize reduction 158, result has 20.6 percent of original size [2022-07-12 13:06:18,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 62 [2022-07-12 13:06:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,059 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-12 13:06:18,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 58 [2022-07-12 13:06:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 13:06:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 74 [2022-07-12 13:06:18,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,765 INFO L356 Elim1Store]: treesize reduction 59, result has 21.3 percent of original size [2022-07-12 13:06:18,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 75 [2022-07-12 13:06:18,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:06:18,776 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-12 13:06:18,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 60 [2022-07-12 13:06:18,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2022-07-12 13:06:18,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-12 13:06:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-12 13:06:18,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:06:18,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1955) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1957) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_1956) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (<= .cse0 0) (not (<= .cse0 2147483647))))) is different from false [2022-07-12 13:06:18,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723445501] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:06:18,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:06:18,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 37 [2022-07-12 13:06:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615475537] [2022-07-12 13:06:18,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:06:18,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 13:06:18,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:06:18,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 13:06:18,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1215, Unknown=1, NotChecked=70, Total=1406 [2022-07-12 13:06:18,921 INFO L87 Difference]: Start difference. First operand 2183 states and 3118 transitions. Second operand has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-07-12 13:06:22,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:24,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:26,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:28,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:34,334 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:42,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:06:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:06:55,602 INFO L93 Difference]: Finished difference Result 5353 states and 8062 transitions. [2022-07-12 13:06:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-12 13:06:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) Word has length 301 [2022-07-12 13:06:55,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:06:55,613 INFO L225 Difference]: With dead ends: 5353 [2022-07-12 13:06:55,613 INFO L226 Difference]: Without dead ends: 3731 [2022-07-12 13:06:55,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 356 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=416, Invalid=4143, Unknown=1, NotChecked=132, Total=4692 [2022-07-12 13:06:55,619 INFO L413 NwaCegarLoop]: 2359 mSDtfsCounter, 5990 mSDsluCounter, 25455 mSDsCounter, 0 mSdLazyCounter, 28275 mSolverCounterSat, 3280 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6240 SdHoareTripleChecker+Valid, 27814 SdHoareTripleChecker+Invalid, 37465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3280 IncrementalHoareTripleChecker+Valid, 28275 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 5905 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:06:55,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6240 Valid, 27814 Invalid, 37465 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3280 Valid, 28275 Invalid, 5 Unknown, 5905 Unchecked, 35.1s Time] [2022-07-12 13:06:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2022-07-12 13:06:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 2206. [2022-07-12 13:06:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2206 states, 1615 states have (on average 1.3764705882352941) internal successors, (2223), 1659 states have internal predecessors, (2223), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 454 states have call predecessors, (476), 456 states have call successors, (476) [2022-07-12 13:06:55,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3155 transitions. [2022-07-12 13:06:55,799 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3155 transitions. Word has length 301 [2022-07-12 13:06:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:06:55,799 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 3155 transitions. [2022-07-12 13:06:55,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.555555555555555) internal successors, (236), 26 states have internal predecessors, (236), 11 states have call successors, (61), 11 states have call predecessors, (61), 10 states have return successors, (44), 13 states have call predecessors, (44), 11 states have call successors, (44) [2022-07-12 13:06:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3155 transitions. [2022-07-12 13:06:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-12 13:06:55,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:06:55,807 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:06:55,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 13:06:56,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:06:56,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:06:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:06:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1080048572, now seen corresponding path program 1 times [2022-07-12 13:06:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:06:56,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424823909] [2022-07-12 13:06:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:06:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:06:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:06:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:06:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:06:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:06:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:06:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:06:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:06:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:06:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:06:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:06:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:06:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:06:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:06:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:06:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:06:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:06:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 13:06:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 13:06:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:06:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:06:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 13:06:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 13:06:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-12 13:06:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 13:06:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-12 13:06:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 13:06:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-12 13:06:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-12 13:06:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-12 13:06:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:06:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 455 trivial. 0 not checked. [2022-07-12 13:06:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:06:56,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424823909] [2022-07-12 13:06:56,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424823909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 13:06:56,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 13:06:56,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 13:06:56,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366452329] [2022-07-12 13:06:56,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 13:06:56,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 13:06:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:06:56,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 13:06:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 13:06:56,406 INFO L87 Difference]: Start difference. First operand 2206 states and 3155 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 13:06:59,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 13:07:07,099 INFO L93 Difference]: Finished difference Result 5379 states and 8104 transitions. [2022-07-12 13:07:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 13:07:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 307 [2022-07-12 13:07:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 13:07:07,110 INFO L225 Difference]: With dead ends: 5379 [2022-07-12 13:07:07,110 INFO L226 Difference]: Without dead ends: 3765 [2022-07-12 13:07:07,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-12 13:07:07,117 INFO L413 NwaCegarLoop]: 2233 mSDtfsCounter, 2914 mSDsluCounter, 8831 mSDsCounter, 0 mSdLazyCounter, 8158 mSolverCounterSat, 1302 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3080 SdHoareTripleChecker+Valid, 11064 SdHoareTripleChecker+Invalid, 9461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1302 IncrementalHoareTripleChecker+Valid, 8158 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-12 13:07:07,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3080 Valid, 11064 Invalid, 9461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1302 Valid, 8158 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2022-07-12 13:07:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-07-12 13:07:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 2209. [2022-07-12 13:07:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 1618 states have (on average 1.3757725587144622) internal successors, (2226), 1661 states have internal predecessors, (2226), 456 states have call successors, (456), 128 states have call predecessors, (456), 134 states have return successors, (476), 455 states have call predecessors, (476), 456 states have call successors, (476) [2022-07-12 13:07:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3158 transitions. [2022-07-12 13:07:07,302 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3158 transitions. Word has length 307 [2022-07-12 13:07:07,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 13:07:07,302 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 3158 transitions. [2022-07-12 13:07:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 5 states have internal predecessors, (129), 2 states have call successors, (30), 6 states have call predecessors, (30), 2 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-12 13:07:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3158 transitions. [2022-07-12 13:07:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-12 13:07:07,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 13:07:07,310 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 13:07:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 13:07:07,310 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 13:07:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 13:07:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1959306136, now seen corresponding path program 2 times [2022-07-12 13:07:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 13:07:07,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845116447] [2022-07-12 13:07:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 13:07:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 13:07:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:07:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 13:07:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 13:07:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 13:07:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 13:07:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 13:07:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 13:07:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 13:07:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 13:07:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 13:07:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 13:07:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 13:07:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 13:07:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 13:07:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 13:07:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:07:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 13:07:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 13:07:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 13:07:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 13:07:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 13:07:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-12 13:07:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 13:07:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 13:07:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 13:07:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 13:07:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 13:07:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-12 13:07:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-12 13:07:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-12 13:07:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 13:07:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2022-07-12 13:07:07,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 13:07:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845116447] [2022-07-12 13:07:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845116447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:07:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870436156] [2022-07-12 13:07:07,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 13:07:07,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 13:07:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 13:07:07,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 13:07:07,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 13:07:10,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 13:07:10,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 13:07:10,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 197 conjunts are in the unsatisfiable core [2022-07-12 13:07:10,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 13:07:10,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 13:07:10,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 13:07:10,566 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:07:10,633 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:07:10,713 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 13:07:10,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 13:07:10,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 13:07:10,826 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:07:10,885 INFO L390 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-12 13:07:10,930 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-12 13:07:10,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-12 13:07:11,186 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-12 13:07:11,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-07-12 13:07:11,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-07-12 13:07:11,437 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-12 13:07:11,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 13:07:11,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:07:11,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:11,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:11,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:11,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-12 13:07:11,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:07:11,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 13:07:11,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:11,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:07:11,885 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 13:07:11,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:07:11,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:11,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 13:07:12,081 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-12 13:07:12,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 31 [2022-07-12 13:07:12,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2022-07-12 13:07:12,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2022-07-12 13:07:12,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-12 13:07:12,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2022-07-12 13:07:12,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2022-07-12 13:07:12,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 13:07:12,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 13:07:12,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:07:12,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:07:12,436 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 13:07:12,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2022-07-12 13:07:12,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 13:07:12,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-12 13:07:12,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2022-07-12 13:07:12,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 13:07:12,646 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-12 13:07:12,647 INFO L390 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 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:07:12,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:07:12,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:07:12,899 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-12 13:07:12,899 INFO L390 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 3 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 13:07:12,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-12 13:07:12,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:12,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-12 13:07:13,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:13,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2022-07-12 13:07:13,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:13,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2022-07-12 13:07:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 13:07:13,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-12 13:07:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 179 proven. 36 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-07-12 13:07:13,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 13:07:13,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2559 (Array Int Int)) (v_ArrVal_2558 (Array Int Int)) (v_ArrVal_2560 (Array Int Int))) (let ((.cse0 (mod (let ((.cse1 (+ |c_ULTIMATE.start_slip_open_~sl~12#1.offset| 12))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2558) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2560) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)) (+ 112 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_slip_open_~tty#1.base| v_ArrVal_2559) |c_ULTIMATE.start_slip_open_~sl~12#1.base|) .cse1)))) 4294967296))) (or (not (<= .cse0 2147483647)) (<= .cse0 0)))) is different from false [2022-07-12 13:07:13,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870436156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 13:07:13,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 13:07:13,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 42] total 49 [2022-07-12 13:07:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973279238] [2022-07-12 13:07:13,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 13:07:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 13:07:13,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 13:07:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 13:07:13,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2207, Unknown=1, NotChecked=94, Total=2450 [2022-07-12 13:07:13,499 INFO L87 Difference]: Start difference. First operand 2209 states and 3158 transitions. Second operand has 49 states, 47 states have (on average 5.595744680851064) internal successors, (263), 37 states have internal predecessors, (263), 15 states have call successors, (64), 14 states have call predecessors, (64), 13 states have return successors, (56), 16 states have call predecessors, (56), 15 states have call successors, (56) [2022-07-12 13:07:16,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:19,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:21,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:23,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:25,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:28,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:31,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:34,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:37,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:39,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:43,759 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:45,792 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:48,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:50,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:51,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:56,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:07:58,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:00,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:06,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:08,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:10,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:12,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:26,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 13:08:31,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []