./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 f4b24e32 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-?-f4b24e3 [2022-07-14 00:45:01,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:45:01,187 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:45:01,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:45:01,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:45:01,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:45:01,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:45:01,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:45:01,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:45:01,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:45:01,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:45:01,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:45:01,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:45:01,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:45:01,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:45:01,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:45:01,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:45:01,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:45:01,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:45:01,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:45:01,242 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:45:01,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:45:01,244 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:45:01,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:45:01,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:45:01,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:45:01,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:45:01,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:45:01,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:45:01,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:45:01,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:45:01,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:45:01,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:45:01,255 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:45:01,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:45:01,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:45:01,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:45:01,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:45:01,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:45:01,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:45:01,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:45:01,260 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:45:01,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:45:01,287 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:45:01,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:45:01,288 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:45:01,288 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:45:01,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:45:01,289 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:45:01,289 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:45:01,289 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:45:01,289 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:45:01,290 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:45:01,290 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:45:01,290 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:45:01,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:45:01,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:45:01,292 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:45:01,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:45:01,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:45:01,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:45:01,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:45:01,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:45:01,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:45:01,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:45:01,294 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:45:01,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:45:01,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:45:01,294 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-14 00:45:01,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:45:01,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:45:01,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:45:01,506 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:45:01,507 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:45:01,508 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-14 00:45:01,562 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd8180c/27fc5bf8c7ff4605a4031c427ac5ac47/FLAG0803f96f9 [2022-07-14 00:45:02,165 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:45:02,166 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-14 00:45:02,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd8180c/27fc5bf8c7ff4605a4031c427ac5ac47/FLAG0803f96f9 [2022-07-14 00:45:02,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9bd8180c/27fc5bf8c7ff4605a4031c427ac5ac47 [2022-07-14 00:45:02,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:45:02,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:45:02,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:45:02,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:45:02,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:45:02,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:45:02" (1/1) ... [2022-07-14 00:45:02,594 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6b1dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:02, skipping insertion in model container [2022-07-14 00:45:02,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:45:02" (1/1) ... [2022-07-14 00:45:02,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:45:02,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:45:03,474 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-14 00:45:03,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:45:03,516 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:45:03,702 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-14 00:45:03,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:45:03,794 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:45:03,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03 WrapperNode [2022-07-14 00:45:03,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:45:03,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:45:03,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:45:03,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:45:03,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:03,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:03,914 INFO L137 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3223 [2022-07-14 00:45:03,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:45:03,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:45:03,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:45:03,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:45:03,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:03,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:03,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:03,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:04,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:04,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:04,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:04,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:45:04,078 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:45:04,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:45:04,078 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:45:04,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (1/1) ... [2022-07-14 00:45:04,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:45:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:45:04,100 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-14 00:45:04,105 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-14 00:45:04,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-14 00:45:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-14 00:45:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-14 00:45:04,131 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-14 00:45:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:45:04,131 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-14 00:45:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-14 00:45:04,132 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-14 00:45:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:45:04,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:45:04,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:45:04,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:45:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:45:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:45:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:45:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-14 00:45:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-14 00:45:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-14 00:45:04,135 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-14 00:45:04,135 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-14 00:45:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-14 00:45:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:45:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:45:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-14 00:45:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-14 00:45:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:45:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:45:04,136 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-14 00:45:04,136 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-14 00:45:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-14 00:45:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-14 00:45:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:45:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:45:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-14 00:45:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-14 00:45:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:45:04,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:45:04,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:45:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-14 00:45:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-14 00:45:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:45:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:45:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:45:04,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:45:04,138 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-14 00:45:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-14 00:45:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-14 00:45:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-14 00:45:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:45:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-14 00:45:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-14 00:45:04,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-14 00:45:04,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-14 00:45:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-14 00:45:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-14 00:45:04,140 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-14 00:45:04,140 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-14 00:45:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:45:04,141 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-14 00:45:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-14 00:45:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-14 00:45:04,142 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-14 00:45:04,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:45:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:45:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 00:45:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-14 00:45:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-14 00:45:04,143 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-14 00:45:04,143 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-14 00:45:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-14 00:45:04,144 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-14 00:45:04,144 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-14 00:45:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-14 00:45:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:45:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-14 00:45:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-14 00:45:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 00:45:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 00:45:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-14 00:45:04,145 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-14 00:45:04,145 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-14 00:45:04,146 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-14 00:45:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-14 00:45:04,146 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-14 00:45:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:45:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-14 00:45:04,146 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-14 00:45:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:45:04,146 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-14 00:45:04,147 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-14 00:45:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-14 00:45:04,147 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-14 00:45:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-14 00:45:04,147 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-14 00:45:04,147 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:45:04,148 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:45:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-14 00:45:04,148 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-14 00:45:04,148 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-14 00:45:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-14 00:45:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-14 00:45:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-14 00:45:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-14 00:45:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-14 00:45:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-14 00:45:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-14 00:45:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-14 00:45:04,150 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-14 00:45:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-14 00:45:04,150 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-14 00:45:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:45:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-14 00:45:04,150 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-14 00:45:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-14 00:45:04,151 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-14 00:45:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-14 00:45:04,151 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-14 00:45:04,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:45:04,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:45:04,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:45:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-14 00:45:04,154 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-14 00:45:04,154 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-14 00:45:04,155 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-14 00:45:04,550 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:45:04,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:45:04,741 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:45:08,083 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:45:08,102 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:45:08,103 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:45:08,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:45:08 BoogieIcfgContainer [2022-07-14 00:45:08,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:45:08,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:45:08,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:45:08,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:45:08,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:45:02" (1/3) ... [2022-07-14 00:45:08,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303cb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:45:08, skipping insertion in model container [2022-07-14 00:45:08,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:03" (2/3) ... [2022-07-14 00:45:08,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303cb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:45:08, skipping insertion in model container [2022-07-14 00:45:08,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:45:08" (3/3) ... [2022-07-14 00:45:08,112 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-14 00:45:08,122 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:45:08,122 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:45:08,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:45:08,194 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@323abdfb, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3839b868 [2022-07-14 00:45:08,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:45:08,201 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-14 00:45:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-14 00:45:08,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:08,226 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-14 00:45:08,226 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484925, now seen corresponding path program 1 times [2022-07-14 00:45:08,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:08,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73032014] [2022-07-14 00:45:08,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:08,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:08,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:08,779 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-14 00:45:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:08,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73032014] [2022-07-14 00:45:08,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73032014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:08,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:08,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:45:08,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052063130] [2022-07-14 00:45:08,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:08,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:45:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:08,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:45:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:45:08,809 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-14 00:45:11,205 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-14 00:45:13,631 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-14 00:45:15,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:15,037 INFO L93 Difference]: Finished difference Result 2346 states and 3526 transitions. [2022-07-14 00:45:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:45:15,048 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-14 00:45:15,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:15,072 INFO L225 Difference]: With dead ends: 2346 [2022-07-14 00:45:15,072 INFO L226 Difference]: Without dead ends: 1198 [2022-07-14 00:45:15,079 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-14 00:45:15,081 INFO L413 NwaCegarLoop]: 1533 mSDtfsCounter, 1208 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 679 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:15,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 3193 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 1270 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-07-14 00:45:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-07-14 00:45:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1068. [2022-07-14 00:45:15,185 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-14 00:45:15,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1566 transitions. [2022-07-14 00:45:15,196 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1566 transitions. Word has length 161 [2022-07-14 00:45:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:15,196 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1566 transitions. [2022-07-14 00:45:15,197 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-14 00:45:15,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1566 transitions. [2022-07-14 00:45:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-14 00:45:15,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:15,205 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-14 00:45:15,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:45:15,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:15,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:15,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1068684857, now seen corresponding path program 1 times [2022-07-14 00:45:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592517906] [2022-07-14 00:45:15,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:15,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:15,491 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-14 00:45:15,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592517906] [2022-07-14 00:45:15,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592517906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:15,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:15,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741584870] [2022-07-14 00:45:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:15,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:15,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:15,495 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-14 00:45:18,759 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-14 00:45:21,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:21,952 INFO L93 Difference]: Finished difference Result 2892 states and 4264 transitions. [2022-07-14 00:45:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:45:21,953 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-14 00:45:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:21,974 INFO L225 Difference]: With dead ends: 2892 [2022-07-14 00:45:21,975 INFO L226 Difference]: Without dead ends: 1860 [2022-07-14 00:45:21,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:45:21,984 INFO L413 NwaCegarLoop]: 1537 mSDtfsCounter, 2564 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 1275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1275 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:21,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 3837 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1275 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-14 00:45:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-14 00:45:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-14 00:45:22,039 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-14 00:45:22,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2352 transitions. [2022-07-14 00:45:22,046 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2352 transitions. Word has length 161 [2022-07-14 00:45:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:22,047 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2352 transitions. [2022-07-14 00:45:22,047 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-14 00:45:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2352 transitions. [2022-07-14 00:45:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-14 00:45:22,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:22,051 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-14 00:45:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:45:22,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -194454501, now seen corresponding path program 1 times [2022-07-14 00:45:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129288750] [2022-07-14 00:45:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:45:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:45:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:45:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:22,392 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-14 00:45:22,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:22,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129288750] [2022-07-14 00:45:22,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129288750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:22,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:22,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803953271] [2022-07-14 00:45:22,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:22,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:22,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:22,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:22,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:22,394 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-14 00:45:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:24,831 INFO L93 Difference]: Finished difference Result 3442 states and 5039 transitions. [2022-07-14 00:45:24,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:45:24,832 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-14 00:45:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:24,841 INFO L225 Difference]: With dead ends: 3442 [2022-07-14 00:45:24,841 INFO L226 Difference]: Without dead ends: 1860 [2022-07-14 00:45:24,845 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-14 00:45:24,846 INFO L413 NwaCegarLoop]: 1456 mSDtfsCounter, 2869 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 1255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3011 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1255 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:24,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3011 Valid, 2532 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1255 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-14 00:45:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-14 00:45:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-14 00:45:24,895 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-14 00:45:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2350 transitions. [2022-07-14 00:45:24,903 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2350 transitions. Word has length 222 [2022-07-14 00:45:24,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:24,903 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2350 transitions. [2022-07-14 00:45:24,904 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-14 00:45:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2350 transitions. [2022-07-14 00:45:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-14 00:45:24,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:24,908 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-14 00:45:24,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:45:24,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:24,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1714003289, now seen corresponding path program 1 times [2022-07-14 00:45:24,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:24,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583543132] [2022-07-14 00:45:24,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:24,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:45:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-14 00:45:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:45:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:25,185 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-14 00:45:25,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:25,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583543132] [2022-07-14 00:45:25,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583543132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:25,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:25,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:45:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165764215] [2022-07-14 00:45:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:25,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:45:25,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:25,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:45:25,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:45:25,187 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-14 00:45:27,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:29,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:32,052 INFO L93 Difference]: Finished difference Result 3446 states and 5039 transitions. [2022-07-14 00:45:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:45:32,053 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-14 00:45:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:32,062 INFO L225 Difference]: With dead ends: 3446 [2022-07-14 00:45:32,063 INFO L226 Difference]: Without dead ends: 1860 [2022-07-14 00:45:32,067 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-14 00:45:32,069 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 1205 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 4653 SdHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:32,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 4653 Invalid, 3590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 00:45:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-14 00:45:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-14 00:45:32,127 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-14 00:45:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2348 transitions. [2022-07-14 00:45:32,134 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2348 transitions. Word has length 222 [2022-07-14 00:45:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:32,136 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2348 transitions. [2022-07-14 00:45:32,136 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-14 00:45:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2348 transitions. [2022-07-14 00:45:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-14 00:45:32,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:32,141 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-14 00:45:32,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:45:32,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1427997940, now seen corresponding path program 1 times [2022-07-14 00:45:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:32,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951711390] [2022-07-14 00:45:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:45:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:45:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:45:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:32,403 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-14 00:45:32,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:32,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951711390] [2022-07-14 00:45:32,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951711390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:32,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:32,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:45:32,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348930841] [2022-07-14 00:45:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:32,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:45:32,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:45:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:45:32,406 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-14 00:45:33,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:38,055 INFO L93 Difference]: Finished difference Result 2450 states and 3737 transitions. [2022-07-14 00:45:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:45:38,056 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-14 00:45:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:38,067 INFO L225 Difference]: With dead ends: 2450 [2022-07-14 00:45:38,067 INFO L226 Difference]: Without dead ends: 2448 [2022-07-14 00:45:38,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 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-14 00:45:38,069 INFO L413 NwaCegarLoop]: 2074 mSDtfsCounter, 1995 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:38,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 6692 Invalid, 4299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 3424 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-14 00:45:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-14 00:45:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1630. [2022-07-14 00:45:38,133 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-14 00:45:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2350 transitions. [2022-07-14 00:45:38,138 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2350 transitions. Word has length 225 [2022-07-14 00:45:38,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:38,138 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2350 transitions. [2022-07-14 00:45:38,139 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-14 00:45:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2350 transitions. [2022-07-14 00:45:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-14 00:45:38,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:38,158 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-14 00:45:38,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:45:38,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1191754029, now seen corresponding path program 1 times [2022-07-14 00:45:38,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:38,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606833900] [2022-07-14 00:45:38,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:45:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:45:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:45:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-14 00:45:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:38,449 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-14 00:45:38,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:38,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606833900] [2022-07-14 00:45:38,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606833900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:38,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:38,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:45:38,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972797271] [2022-07-14 00:45:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:38,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:45:38,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:38,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:45:38,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:45:38,451 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-14 00:45:42,205 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-14 00:45:43,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:47,060 INFO L93 Difference]: Finished difference Result 4036 states and 6029 transitions. [2022-07-14 00:45:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:45:47,061 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-14 00:45:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:47,073 INFO L225 Difference]: With dead ends: 4036 [2022-07-14 00:45:47,074 INFO L226 Difference]: Without dead ends: 2452 [2022-07-14 00:45:47,080 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-14 00:45:47,080 INFO L413 NwaCegarLoop]: 1819 mSDtfsCounter, 2957 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 3444 mSolverCounterSat, 1170 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3230 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 4615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1170 IncrementalHoareTripleChecker+Valid, 3444 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3230 Valid, 5449 Invalid, 4615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1170 Valid, 3444 Invalid, 1 Unknown, 0 Unchecked, 8.4s Time] [2022-07-14 00:45:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-07-14 00:45:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1631. [2022-07-14 00:45:47,152 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-14 00:45:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2351 transitions. [2022-07-14 00:45:47,158 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2351 transitions. Word has length 235 [2022-07-14 00:45:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:47,159 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2351 transitions. [2022-07-14 00:45:47,159 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-14 00:45:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2351 transitions. [2022-07-14 00:45:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-14 00:45:47,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:47,165 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-14 00:45:47,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:45:47,165 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:47,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1290014060, now seen corresponding path program 1 times [2022-07-14 00:45:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:47,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254870284] [2022-07-14 00:45:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:45:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:45:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:45:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:45:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:45:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:45:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:45:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:45:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:45:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:45:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:45:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:45:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:45:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:45:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:45:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:47,450 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-14 00:45:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:47,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254870284] [2022-07-14 00:45:47,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254870284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:47,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:47,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:45:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495020592] [2022-07-14 00:45:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:47,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:45:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:47,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:45:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:45:47,452 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-14 00:45:50,330 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-14 00:45:52,350 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-14 00:45:54,533 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-14 00:45:56,554 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-14 00:46:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:00,795 INFO L93 Difference]: Finished difference Result 3383 states and 5318 transitions. [2022-07-14 00:46:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 00:46:00,796 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-14 00:46:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:00,810 INFO L225 Difference]: With dead ends: 3383 [2022-07-14 00:46:00,810 INFO L226 Difference]: Without dead ends: 3381 [2022-07-14 00:46:00,811 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-14 00:46:00,811 INFO L413 NwaCegarLoop]: 2506 mSDtfsCounter, 2808 mSDsluCounter, 8108 mSDsCounter, 0 mSdLazyCounter, 5748 mSolverCounterSat, 1212 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 10614 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1212 IncrementalHoareTripleChecker+Valid, 5748 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:00,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 10614 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1212 Valid, 5748 Invalid, 4 Unknown, 0 Unchecked, 13.0s Time] [2022-07-14 00:46:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-14 00:46:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 1633. [2022-07-14 00:46:00,887 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-14 00:46:00,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2354 transitions. [2022-07-14 00:46:00,892 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2354 transitions. Word has length 237 [2022-07-14 00:46:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:00,892 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2354 transitions. [2022-07-14 00:46:00,893 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-14 00:46:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2354 transitions. [2022-07-14 00:46:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-14 00:46:00,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:00,899 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-14 00:46:00,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:46:00,900 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash -278810711, now seen corresponding path program 1 times [2022-07-14 00:46:00,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836869213] [2022-07-14 00:46:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:00,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-14 00:46:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 00:46:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-14 00:46:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 00:46:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:01,191 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-14 00:46:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:01,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836869213] [2022-07-14 00:46:01,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836869213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:01,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:01,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:46:01,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144300586] [2022-07-14 00:46:01,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:01,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:46:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:46:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:46:01,193 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-14 00:46:03,408 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-14 00:46:06,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:08,851 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-14 00:46:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:11,170 INFO L93 Difference]: Finished difference Result 4094 states and 5974 transitions. [2022-07-14 00:46:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:46:11,171 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-14 00:46:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:11,185 INFO L225 Difference]: With dead ends: 4094 [2022-07-14 00:46:11,185 INFO L226 Difference]: Without dead ends: 2507 [2022-07-14 00:46:11,190 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-14 00:46:11,191 INFO L413 NwaCegarLoop]: 2165 mSDtfsCounter, 2322 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 1054 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2497 SdHoareTripleChecker+Valid, 4748 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:11,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2497 Valid, 4748 Invalid, 3511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1054 Valid, 2455 Invalid, 2 Unknown, 0 Unchecked, 9.7s Time] [2022-07-14 00:46:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-07-14 00:46:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2168. [2022-07-14 00:46:11,299 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-14 00:46:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 3109 transitions. [2022-07-14 00:46:11,307 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 3109 transitions. Word has length 267 [2022-07-14 00:46:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:11,307 INFO L495 AbstractCegarLoop]: Abstraction has 2168 states and 3109 transitions. [2022-07-14 00:46:11,308 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-14 00:46:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 3109 transitions. [2022-07-14 00:46:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-14 00:46:11,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:11,317 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-14 00:46:11,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:46:11,317 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:11,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:11,317 INFO L85 PathProgramCache]: Analyzing trace with hash 245344003, now seen corresponding path program 1 times [2022-07-14 00:46:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:11,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102379585] [2022-07-14 00:46:11,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:11,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:11,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-14 00:46:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-14 00:46:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:46:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,663 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-14 00:46:11,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102379585] [2022-07-14 00:46:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102379585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:11,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477150185] [2022-07-14 00:46:11,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:11,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:11,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:11,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:11,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:11,666 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-14 00:46:14,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:16,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:16,995 INFO L93 Difference]: Finished difference Result 4681 states and 6962 transitions. [2022-07-14 00:46:16,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:46:16,996 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-14 00:46:16,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:17,014 INFO L225 Difference]: With dead ends: 4681 [2022-07-14 00:46:17,014 INFO L226 Difference]: Without dead ends: 3094 [2022-07-14 00:46:17,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 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-14 00:46:17,021 INFO L413 NwaCegarLoop]: 1999 mSDtfsCounter, 3319 mSDsluCounter, 2540 mSDsCounter, 0 mSdLazyCounter, 2437 mSolverCounterSat, 1395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 4539 SdHoareTripleChecker+Invalid, 3832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1395 IncrementalHoareTripleChecker+Valid, 2437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:17,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 4539 Invalid, 3832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1395 Valid, 2437 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 00:46:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2022-07-14 00:46:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2172. [2022-07-14 00:46:17,170 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-14 00:46:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3114 transitions. [2022-07-14 00:46:17,178 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3114 transitions. Word has length 269 [2022-07-14 00:46:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:17,178 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 3114 transitions. [2022-07-14 00:46:17,179 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-14 00:46:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3114 transitions. [2022-07-14 00:46:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-14 00:46:17,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:17,188 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-14 00:46:17,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:46:17,189 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:17,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1977117601, now seen corresponding path program 1 times [2022-07-14 00:46:17,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500754190] [2022-07-14 00:46:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:17,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 00:46:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:46:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-14 00:46:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-14 00:46:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,415 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-14 00:46:17,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:17,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500754190] [2022-07-14 00:46:17,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500754190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:17,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:17,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:46:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001236529] [2022-07-14 00:46:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:17,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:46:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:46:17,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:46:17,418 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-14 00:46:19,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:21,476 INFO L93 Difference]: Finished difference Result 4635 states and 6767 transitions. [2022-07-14 00:46:21,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:46:21,477 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-14 00:46:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:21,487 INFO L225 Difference]: With dead ends: 4635 [2022-07-14 00:46:21,487 INFO L226 Difference]: Without dead ends: 2509 [2022-07-14 00:46:21,493 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-14 00:46:21,494 INFO L413 NwaCegarLoop]: 1460 mSDtfsCounter, 2056 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 1234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1234 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:21,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 3318 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1234 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-14 00:46:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-14 00:46:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2172. [2022-07-14 00:46:21,614 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-14 00:46:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 3105 transitions. [2022-07-14 00:46:21,619 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 3105 transitions. Word has length 272 [2022-07-14 00:46:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:21,620 INFO L495 AbstractCegarLoop]: Abstraction has 2172 states and 3105 transitions. [2022-07-14 00:46:21,620 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-14 00:46:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 3105 transitions. [2022-07-14 00:46:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-14 00:46:21,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:21,629 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-14 00:46:21,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:46:21,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1130512862, now seen corresponding path program 1 times [2022-07-14 00:46:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579688407] [2022-07-14 00:46:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:21,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-14 00:46:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:46:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-14 00:46:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-14 00:46:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,893 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-14 00:46:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:21,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579688407] [2022-07-14 00:46:21,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579688407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:21,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42697518] [2022-07-14 00:46:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:21,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:21,903 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-14 00:46:21,927 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-14 00:46:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:22,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:46:22,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:22,819 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-14 00:46:22,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:23,085 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-14 00:46:23,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42697518] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:23,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:23,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2022-07-14 00:46:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070367107] [2022-07-14 00:46:23,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:23,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 00:46:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 00:46:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-14 00:46:23,088 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-14 00:46:25,577 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-14 00:46:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:31,278 INFO L93 Difference]: Finished difference Result 6438 states and 9903 transitions. [2022-07-14 00:46:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:46:31,279 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-14 00:46:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:31,313 INFO L225 Difference]: With dead ends: 6438 [2022-07-14 00:46:31,314 INFO L226 Difference]: Without dead ends: 4847 [2022-07-14 00:46:31,318 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-14 00:46:31,319 INFO L413 NwaCegarLoop]: 2859 mSDtfsCounter, 5994 mSDsluCounter, 8975 mSDsCounter, 0 mSdLazyCounter, 6215 mSolverCounterSat, 3061 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6388 SdHoareTripleChecker+Valid, 11834 SdHoareTripleChecker+Invalid, 9277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3061 IncrementalHoareTripleChecker+Valid, 6215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:31,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6388 Valid, 11834 Invalid, 9277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3061 Valid, 6215 Invalid, 1 Unknown, 0 Unchecked, 7.7s Time] [2022-07-14 00:46:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2022-07-14 00:46:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 2179. [2022-07-14 00:46:31,463 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-14 00:46:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3114 transitions. [2022-07-14 00:46:31,469 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3114 transitions. Word has length 275 [2022-07-14 00:46:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:31,470 INFO L495 AbstractCegarLoop]: Abstraction has 2179 states and 3114 transitions. [2022-07-14 00:46:31,470 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-14 00:46:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3114 transitions. [2022-07-14 00:46:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-14 00:46:31,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:31,479 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-14 00:46:31,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 00:46:31,695 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-14 00:46:31,696 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1723971340, now seen corresponding path program 1 times [2022-07-14 00:46:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018203767] [2022-07-14 00:46:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-14 00:46:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 00:46:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-14 00:46:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-14 00:46:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,182 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-14 00:46:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018203767] [2022-07-14 00:46:32,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018203767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:32,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106271460] [2022-07-14 00:46:32,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:32,184 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-14 00:46:32,185 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-14 00:46:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 00:46:32,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:32,870 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-14 00:46:32,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:32,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106271460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:32,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:32,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-14 00:46:32,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913125599] [2022-07-14 00:46:32,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:32,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:46:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:32,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:46:32,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:46:32,872 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-14 00:46:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:33,220 INFO L93 Difference]: Finished difference Result 4707 states and 6899 transitions. [2022-07-14 00:46:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:46:33,220 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-14 00:46:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:33,229 INFO L225 Difference]: With dead ends: 4707 [2022-07-14 00:46:33,230 INFO L226 Difference]: Without dead ends: 3109 [2022-07-14 00:46:33,234 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-14 00:46:33,235 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-14 00:46:33,235 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-14 00:46:33,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-07-14 00:46:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2181. [2022-07-14 00:46:33,344 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-14 00:46:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 3116 transitions. [2022-07-14 00:46:33,350 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 3116 transitions. Word has length 284 [2022-07-14 00:46:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:33,350 INFO L495 AbstractCegarLoop]: Abstraction has 2181 states and 3116 transitions. [2022-07-14 00:46:33,350 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-14 00:46:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 3116 transitions. [2022-07-14 00:46:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-14 00:46:33,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:33,358 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-14 00:46:33,383 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-14 00:46:33,575 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-14 00:46:33,575 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1388851498, now seen corresponding path program 1 times [2022-07-14 00:46:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:33,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58337286] [2022-07-14 00:46:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:33,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:33,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-14 00:46:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-14 00:46:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-14 00:46:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-14 00:46:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-14 00:46:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 00:46:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:33,860 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-14 00:46:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:33,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58337286] [2022-07-14 00:46:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58337286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:33,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:33,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:33,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234306270] [2022-07-14 00:46:33,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:33,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:33,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:33,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:33,862 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-14 00:46:35,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:39,008 INFO L93 Difference]: Finished difference Result 4746 states and 7039 transitions. [2022-07-14 00:46:39,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:46:39,008 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-14 00:46:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:39,016 INFO L225 Difference]: With dead ends: 4746 [2022-07-14 00:46:39,017 INFO L226 Difference]: Without dead ends: 3146 [2022-07-14 00:46:39,020 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-14 00:46:39,020 INFO L413 NwaCegarLoop]: 1979 mSDtfsCounter, 2620 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 2681 mSolverCounterSat, 1420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2756 SdHoareTripleChecker+Valid, 5126 SdHoareTripleChecker+Invalid, 4101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1420 IncrementalHoareTripleChecker+Valid, 2681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:39,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2756 Valid, 5126 Invalid, 4101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1420 Valid, 2681 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 00:46:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2022-07-14 00:46:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 2183. [2022-07-14 00:46:39,144 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-14 00:46:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 3118 transitions. [2022-07-14 00:46:39,149 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 3118 transitions. Word has length 293 [2022-07-14 00:46:39,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:39,150 INFO L495 AbstractCegarLoop]: Abstraction has 2183 states and 3118 transitions. [2022-07-14 00:46:39,150 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-14 00:46:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 3118 transitions. [2022-07-14 00:46:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-14 00:46:39,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:39,164 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-14 00:46:39,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 00:46:39,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:39,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:39,165 INFO L85 PathProgramCache]: Analyzing trace with hash -279572144, now seen corresponding path program 1 times [2022-07-14 00:46:39,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:39,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212592554] [2022-07-14 00:46:39,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:39,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:46:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:46:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:46:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:46:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:46:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:46:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:46:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-14 00:46:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-14 00:46:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-14 00:46:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-14 00:46:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 00:46:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 00:46:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-07-14 00:46:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-14 00:46:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,590 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-14 00:46:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212592554] [2022-07-14 00:46:39,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212592554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132216672] [2022-07-14 00:46:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:39,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:39,592 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-14 00:46:39,593 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-14 00:46:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:40,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 200 conjunts are in the unsatisfiable core [2022-07-14 00:46:40,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:41,238 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-14 00:46:41,472 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-14 00:46:41,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 00:46:41,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,488 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-14 00:46:41,505 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-14 00:46:41,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,595 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-14 00:46:41,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,611 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-14 00:46:41,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,634 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-14 00:46:41,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,898 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-14 00:46:41,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,908 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-14 00:46:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:41,925 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-14 00:46:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,159 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-14 00:46:42,179 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-14 00:46:42,180 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 76 [2022-07-14 00:46:42,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,196 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-14 00:46:42,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,236 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-07-14 00:46:42,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:46:42,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-07-14 00:46:42,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,254 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-14 00:46:42,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,405 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-14 00:46:42,405 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-14 00:46:42,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,412 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 30 treesize of output 32 [2022-07-14 00:46:42,418 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 20 treesize of output 22 [2022-07-14 00:46:42,422 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 58 treesize of output 50 [2022-07-14 00:46:42,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,445 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-14 00:46:42,449 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-14 00:46:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,735 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 27 treesize of output 26 [2022-07-14 00:46:42,762 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-07-14 00:46:42,762 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 65 treesize of output 58 [2022-07-14 00:46:42,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:42,785 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-14 00:46:43,188 INFO L356 Elim1Store]: treesize reduction 158, result has 20.6 percent of original size [2022-07-14 00:46:43,188 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-14 00:46:43,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,215 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-14 00:46:43,215 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 65 treesize of output 58 [2022-07-14 00:46:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,221 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 27 treesize of output 26 [2022-07-14 00:46:43,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,786 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-14 00:46:43,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,806 INFO L356 Elim1Store]: treesize reduction 55, result has 22.5 percent of original size [2022-07-14 00:46:43,807 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 104 treesize of output 75 [2022-07-14 00:46:43,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:46:43,819 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-14 00:46:43,819 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 90 treesize of output 60 [2022-07-14 00:46:43,823 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-14 00:46:43,825 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-14 00:46:43,893 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-14 00:46:43,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:43,947 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-14 00:46:43,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132216672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:43,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:46:43,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 37 [2022-07-14 00:46:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289971023] [2022-07-14 00:46:43,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:43,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 00:46:43,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 00:46:43,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1215, Unknown=1, NotChecked=70, Total=1406 [2022-07-14 00:46:43,966 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-14 00:46:47,291 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-14 00:46:49,384 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-14 00:46:51,471 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-14 00:46:53,557 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-14 00:46:55,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-14 00:46:57,739 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-14 00:46:59,827 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-14 00:47:01,915 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-14 00:47:04,006 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-14 00:47:08,147 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-14 00:47:10,778 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-14 00:47:12,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:14,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:17,465 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-14 00:47:19,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:20,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:41,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:41,340 INFO L93 Difference]: Finished difference Result 5353 states and 8062 transitions. [2022-07-14 00:47:41,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-14 00:47:41,341 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-14 00:47:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:41,350 INFO L225 Difference]: With dead ends: 5353 [2022-07-14 00:47:41,350 INFO L226 Difference]: Without dead ends: 3731 [2022-07-14 00:47:41,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 355 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=416, Invalid=4143, Unknown=1, NotChecked=132, Total=4692 [2022-07-14 00:47:41,355 INFO L413 NwaCegarLoop]: 2362 mSDtfsCounter, 5971 mSDsluCounter, 25430 mSDsCounter, 0 mSdLazyCounter, 30015 mSolverCounterSat, 3266 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6219 SdHoareTripleChecker+Valid, 27792 SdHoareTripleChecker+Invalid, 36852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3266 IncrementalHoareTripleChecker+Valid, 30015 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 3559 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:41,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6219 Valid, 27792 Invalid, 36852 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3266 Valid, 30015 Invalid, 12 Unknown, 3559 Unchecked, 55.8s Time] [2022-07-14 00:47:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2022-07-14 00:47:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 2206. [2022-07-14 00:47:41,495 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-14 00:47:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3155 transitions. [2022-07-14 00:47:41,500 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3155 transitions. Word has length 301 [2022-07-14 00:47:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:41,501 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 3155 transitions. [2022-07-14 00:47:41,501 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-14 00:47:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3155 transitions. [2022-07-14 00:47:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-14 00:47:41,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:41,508 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-14 00:47:41,531 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-14 00:47:41,723 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-14 00:47:41,723 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:41,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:41,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1080048572, now seen corresponding path program 1 times [2022-07-14 00:47:41,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:47:41,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205665664] [2022-07-14 00:47:41,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:47:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:47:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:47:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:47:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:47:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:47:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:47:41,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:47:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:47:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:47:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:47:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:47:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:47:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:47:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:47:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:47:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:47:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-14 00:47:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 00:47:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-14 00:47:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:47:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 00:47:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-14 00:47:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-14 00:47:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 00:47:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:47:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-14 00:47:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-14 00:47:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:42,082 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-14 00:47:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:47:42,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205665664] [2022-07-14 00:47:42,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205665664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:47:42,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:47:42,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 00:47:42,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389554932] [2022-07-14 00:47:42,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:47:42,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 00:47:42,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:47:42,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 00:47:42,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:47:42,084 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-14 00:47:44,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:47,553 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-14 00:47:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:53,951 INFO L93 Difference]: Finished difference Result 5379 states and 8104 transitions. [2022-07-14 00:47:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 00:47:53,952 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-14 00:47:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:53,962 INFO L225 Difference]: With dead ends: 5379 [2022-07-14 00:47:53,962 INFO L226 Difference]: Without dead ends: 3765 [2022-07-14 00:47:53,967 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-14 00:47:53,969 INFO L413 NwaCegarLoop]: 2231 mSDtfsCounter, 2914 mSDsluCounter, 8831 mSDsCounter, 0 mSdLazyCounter, 8122 mSolverCounterSat, 1310 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3078 SdHoareTripleChecker+Valid, 11062 SdHoareTripleChecker+Invalid, 9433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1310 IncrementalHoareTripleChecker+Valid, 8122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:53,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3078 Valid, 11062 Invalid, 9433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1310 Valid, 8122 Invalid, 1 Unknown, 0 Unchecked, 11.3s Time] [2022-07-14 00:47:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-07-14 00:47:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 2209. [2022-07-14 00:47:54,114 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-14 00:47:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3158 transitions. [2022-07-14 00:47:54,119 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3158 transitions. Word has length 307 [2022-07-14 00:47:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:54,120 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 3158 transitions. [2022-07-14 00:47:54,120 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-14 00:47:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3158 transitions. [2022-07-14 00:47:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-14 00:47:54,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:54,127 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-14 00:47:54,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 00:47:54,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1959306136, now seen corresponding path program 2 times [2022-07-14 00:47:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:47:54,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134345329] [2022-07-14 00:47:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:47:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:47:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:47:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 00:47:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 00:47:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 00:47:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:47:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:47:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:47:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:47:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:47:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-14 00:47:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-14 00:47:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 00:47:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 00:47:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:47:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:47:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-14 00:47:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 00:47:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:47:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:47:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-14 00:47:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:47:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:47:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:47:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-14 00:47:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-14 00:47:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 00:47:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 00:47:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-14 00:47:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-14 00:47:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:54,585 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-14 00:47:54,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:47:54,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134345329] [2022-07-14 00:47:54,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134345329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:47:54,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727375718] [2022-07-14 00:47:54,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:47:54,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:47:54,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:47:54,587 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-14 00:47:54,589 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-14 00:47:56,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:47:56,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:47:56,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 197 conjunts are in the unsatisfiable core [2022-07-14 00:47:56,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:56,960 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-14 00:47:57,109 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-14 00:47:57,167 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-14 00:47:57,232 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-14 00:47:57,310 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 00:47:57,311 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-14 00:47:57,367 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-14 00:47:57,418 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-14 00:47:57,475 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-14 00:47:57,517 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-14 00:47:57,517 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-14 00:47:57,765 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-14 00:47:57,766 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-14 00:47:57,937 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-14 00:47:58,005 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 00:47:58,006 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-14 00:47:58,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 00:47:58,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,331 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-14 00:47:58,335 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-14 00:47:58,343 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-14 00:47:58,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,409 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-14 00:47:58,417 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:47:58,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:47:58,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,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, 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-14 00:47:58,634 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-14 00:47:58,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, 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-14 00:47:58,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,645 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-14 00:47:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,651 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-14 00:47:58,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,841 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-14 00:47:58,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,853 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-14 00:47:58,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:58,863 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-14 00:47:58,868 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-14 00:47:58,873 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-14 00:47:58,878 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-14 00:47:59,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,015 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-14 00:47:59,026 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-14 00:47:59,027 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-14 00:47:59,030 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-14 00:47:59,034 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-14 00:47:59,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,045 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-14 00:47:59,048 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-14 00:47:59,223 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-14 00:47:59,223 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-14 00:47:59,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,233 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-14 00:47:59,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:47:59,442 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-14 00:47:59,443 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-14 00:47:59,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,449 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-14 00:47:59,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 00:47:59,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,817 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-14 00:47:59,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,821 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-14 00:47:59,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 00:47:59,826 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-14 00:47:59,886 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-14 00:47:59,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:47:59,942 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-14 00:47:59,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727375718] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:47:59,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:47:59,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 42] total 49 [2022-07-14 00:47:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790697327] [2022-07-14 00:47:59,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:47:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-14 00:47:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:47:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 00:47:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2207, Unknown=1, NotChecked=94, Total=2450 [2022-07-14 00:47:59,952 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-14 00:48:03,440 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-14 00:48:05,527 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-14 00:48:07,615 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-14 00:48:09,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:11,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:13,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:16,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:18,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:20,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:22,465 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-14 00:48:24,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:26,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:28,840 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-14 00:48:30,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:33,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:35,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:38,836 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-14 00:48:40,868 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-14 00:48:42,910 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-14 00:48:45,403 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:48,771 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-14 00:49:14,004 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 []