./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 eb692b52 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-?-eb692b5 [2022-07-20 00:06:31,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 00:06:31,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 00:06:31,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 00:06:31,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 00:06:31,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 00:06:31,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 00:06:31,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 00:06:31,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 00:06:31,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 00:06:31,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 00:06:31,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 00:06:31,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 00:06:31,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 00:06:31,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 00:06:31,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 00:06:31,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 00:06:31,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 00:06:31,143 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 00:06:31,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 00:06:31,146 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 00:06:31,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 00:06:31,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 00:06:31,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 00:06:31,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 00:06:31,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 00:06:31,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 00:06:31,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 00:06:31,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 00:06:31,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 00:06:31,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 00:06:31,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 00:06:31,162 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 00:06:31,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 00:06:31,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 00:06:31,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 00:06:31,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 00:06:31,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 00:06:31,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 00:06:31,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 00:06:31,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 00:06:31,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 00:06:31,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 00:06:31,203 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 00:06:31,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 00:06:31,203 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 00:06:31,204 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 00:06:31,204 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 00:06:31,205 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 00:06:31,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 00:06:31,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 00:06:31,206 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 00:06:31,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 00:06:31,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 00:06:31,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 00:06:31,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 00:06:31,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 00:06:31,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 00:06:31,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 00:06:31,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 00:06:31,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 00:06:31,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 00:06:31,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 00:06:31,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 00:06:31,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:06:31,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 00:06:31,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 00:06:31,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 00:06:31,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 00:06:31,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 00:06:31,211 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 00:06:31,211 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 00:06:31,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 00:06:31,211 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-20 00:06:31,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 00:06:31,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 00:06:31,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 00:06:31,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 00:06:31,509 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 00:06:31,510 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-20 00:06:31,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9bd3876/386396fa6ea84b1fa3c971197d3c822b/FLAG085149215 [2022-07-20 00:06:32,315 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 00:06:32,316 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-20 00:06:32,364 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9bd3876/386396fa6ea84b1fa3c971197d3c822b/FLAG085149215 [2022-07-20 00:06:32,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff9bd3876/386396fa6ea84b1fa3c971197d3c822b [2022-07-20 00:06:32,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 00:06:32,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 00:06:32,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 00:06:32,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 00:06:32,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 00:06:32,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:06:32" (1/1) ... [2022-07-20 00:06:32,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5b7cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:32, skipping insertion in model container [2022-07-20 00:06:32,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:06:32" (1/1) ... [2022-07-20 00:06:32,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 00:06:32,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 00:06:33,530 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-20 00:06:33,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:06:33,560 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 00:06:33,832 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-20 00:06:33,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 00:06:33,940 INFO L208 MainTranslator]: Completed translation [2022-07-20 00:06:33,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33 WrapperNode [2022-07-20 00:06:33,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 00:06:33,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 00:06:33,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 00:06:33,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 00:06:33,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,128 INFO L137 Inliner]: procedures = 187, calls = 873, calls flagged for inlining = 93, calls inlined = 91, statements flattened = 3223 [2022-07-20 00:06:34,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 00:06:34,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 00:06:34,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 00:06:34,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 00:06:34,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 00:06:34,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 00:06:34,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 00:06:34,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 00:06:34,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (1/1) ... [2022-07-20 00:06:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 00:06:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:06:34,384 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-20 00:06:34,397 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-20 00:06:34,423 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-20 00:06:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-20 00:06:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure sl_tx_timeout [2022-07-20 00:06:34,424 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_tx_timeout [2022-07-20 00:06:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 00:06:34,424 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-20 00:06:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_1 [2022-07-20 00:06:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_1 [2022-07-20 00:06:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 00:06:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 00:06:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 00:06:34,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 00:06:34,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 00:06:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 00:06:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 00:06:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-20 00:06:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-20 00:06:34,426 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-20 00:06:34,426 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-20 00:06:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-20 00:06:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-20 00:06:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-20 00:06:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-20 00:06:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-20 00:06:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-20 00:06:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 00:06:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 00:06:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-20 00:06:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-20 00:06:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-20 00:06:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-20 00:06:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 00:06:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 00:06:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-20 00:06:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-20 00:06:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 00:06:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 00:06:34,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 00:06:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-20 00:06:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-20 00:06:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-20 00:06:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-20 00:06:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-20 00:06:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-20 00:06:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-20 00:06:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-20 00:06:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-20 00:06:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-20 00:06:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 00:06:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_1 [2022-07-20 00:06:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_1 [2022-07-20 00:06:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-20 00:06:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-20 00:06:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-20 00:06:34,432 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-20 00:06:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-20 00:06:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-20 00:06:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 00:06:34,434 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-20 00:06:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-20 00:06:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-20 00:06:34,435 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-20 00:06:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 00:06:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 00:06:34,435 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 00:06:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-20 00:06:34,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-20 00:06:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure slip_compat_ioctl [2022-07-20 00:06:34,436 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_compat_ioctl [2022-07-20 00:06:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-20 00:06:34,436 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-20 00:06:34,436 INFO L130 BoogieDeclarations]: Found specification of procedure sl_get_stats64 [2022-07-20 00:06:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_get_stats64 [2022-07-20 00:06:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 00:06:34,437 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-20 00:06:34,437 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-20 00:06:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-20 00:06:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-20 00:06:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-20 00:06:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-20 00:06:34,438 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-20 00:06:34,438 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-20 00:06:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-20 00:06:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-20 00:06:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 00:06:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-20 00:06:34,439 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-20 00:06:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 00:06:34,439 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-20 00:06:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-20 00:06:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-20 00:06:34,440 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-20 00:06:34,440 INFO L130 BoogieDeclarations]: Found specification of procedure slip_hangup [2022-07-20 00:06:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_hangup [2022-07-20 00:06:34,441 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-20 00:06:34,441 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-20 00:06:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-20 00:06:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-20 00:06:34,442 INFO L130 BoogieDeclarations]: Found specification of procedure sl_change_mtu [2022-07-20 00:06:34,442 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_change_mtu [2022-07-20 00:06:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-07-20 00:06:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-07-20 00:06:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-20 00:06:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-20 00:06:34,443 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-20 00:06:34,443 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-20 00:06:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-20 00:06:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-20 00:06:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-20 00:06:34,444 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-20 00:06:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 00:06:34,444 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-20 00:06:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-20 00:06:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-20 00:06:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-20 00:06:34,445 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-20 00:06:34,445 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-20 00:06:34,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 00:06:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 00:06:34,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 00:06:34,447 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-20 00:06:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-20 00:06:34,448 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-20 00:06:34,448 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-20 00:06:35,003 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 00:06:35,007 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 00:06:35,222 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 00:06:38,858 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 00:06:38,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 00:06:38,876 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 00:06:38,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:06:38 BoogieIcfgContainer [2022-07-20 00:06:38,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 00:06:38,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 00:06:38,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 00:06:38,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 00:06:38,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:06:32" (1/3) ... [2022-07-20 00:06:38,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78320f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:06:38, skipping insertion in model container [2022-07-20 00:06:38,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:06:33" (2/3) ... [2022-07-20 00:06:38,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78320f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:06:38, skipping insertion in model container [2022-07-20 00:06:38,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:06:38" (3/3) ... [2022-07-20 00:06:38,887 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-20 00:06:38,900 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 00:06:38,905 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 00:06:38,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 00:06:39,004 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@46f32554, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bb48578 [2022-07-20 00:06:39,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 00:06:39,013 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-20 00:06:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-20 00:06:39,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:06:39,036 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-20 00:06:39,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:06:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:06:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1607484925, now seen corresponding path program 1 times [2022-07-20 00:06:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:06:39,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20322033] [2022-07-20 00:06:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:06:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:06:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:06:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:06:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:06:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:06:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:06:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:06:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:06:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:06:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:06:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:06:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:06:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:06:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:06:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:06:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:39,774 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-20 00:06:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:06:39,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20322033] [2022-07-20 00:06:39,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20322033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:06:39,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:06:39,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 00:06:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956269357] [2022-07-20 00:06:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:06:39,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 00:06:39,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:06:39,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 00:06:39,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-20 00:06:39,808 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-20 00:06:42,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:06:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:06:44,655 INFO L93 Difference]: Finished difference Result 2346 states and 3526 transitions. [2022-07-20 00:06:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 00:06:44,658 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-20 00:06:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:06:44,686 INFO L225 Difference]: With dead ends: 2346 [2022-07-20 00:06:44,686 INFO L226 Difference]: Without dead ends: 1198 [2022-07-20 00:06:44,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:06:44,707 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 1208 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1264 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:06:44,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1264 Valid, 3191 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-20 00:06:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2022-07-20 00:06:44,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1068. [2022-07-20 00:06:44,841 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-20 00:06:44,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1566 transitions. [2022-07-20 00:06:44,852 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1566 transitions. Word has length 161 [2022-07-20 00:06:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:06:44,853 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1566 transitions. [2022-07-20 00:06:44,853 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-20 00:06:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1566 transitions. [2022-07-20 00:06:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-20 00:06:44,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:06:44,865 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-20 00:06:44,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 00:06:44,865 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:06:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:06:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1068684857, now seen corresponding path program 1 times [2022-07-20 00:06:44,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:06:44,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283330137] [2022-07-20 00:06:44,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:06:44,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:06:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:06:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:06:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:06:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:06:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:06:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:06:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:06:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:06:45,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:06:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:06:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:06:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:06:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:06:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:06:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:45,231 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-20 00:06:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:06:45,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283330137] [2022-07-20 00:06:45,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283330137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:06:45,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:06:45,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:06:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388878508] [2022-07-20 00:06:45,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:06:45,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:06:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:06:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:06:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:06:45,234 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-20 00:06:50,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:06:50,587 INFO L93 Difference]: Finished difference Result 2892 states and 4264 transitions. [2022-07-20 00:06:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:06:50,588 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-20 00:06:50,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:06:50,599 INFO L225 Difference]: With dead ends: 2892 [2022-07-20 00:06:50,600 INFO L226 Difference]: Without dead ends: 1860 [2022-07-20 00:06:50,603 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-20 00:06:50,605 INFO L413 NwaCegarLoop]: 1534 mSDtfsCounter, 2564 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 2459 mSolverCounterSat, 1268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2704 SdHoareTripleChecker+Valid, 3834 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1268 IncrementalHoareTripleChecker+Valid, 2459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:06:50,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2704 Valid, 3834 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1268 Valid, 2459 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-20 00:06:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-20 00:06:50,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-20 00:06:50,677 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-20 00:06:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2352 transitions. [2022-07-20 00:06:50,687 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2352 transitions. Word has length 161 [2022-07-20 00:06:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:06:50,688 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2352 transitions. [2022-07-20 00:06:50,688 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-20 00:06:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2352 transitions. [2022-07-20 00:06:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-20 00:06:50,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:06:50,695 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-20 00:06:50,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 00:06:50,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:06:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:06:50,696 INFO L85 PathProgramCache]: Analyzing trace with hash -194454501, now seen corresponding path program 1 times [2022-07-20 00:06:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:06:50,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280340807] [2022-07-20 00:06:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:06:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:06:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:06:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:06:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:06:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:06:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:06:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:06:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:06:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:06:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:06:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:06:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:06:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:06:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:06:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:06:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:06:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:06:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 00:06:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:51,131 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-20 00:06:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:06:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280340807] [2022-07-20 00:06:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280340807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:06:51,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:06:51,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:06:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556559525] [2022-07-20 00:06:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:06:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:06:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:06:51,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:06:51,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:06:51,136 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-20 00:06:53,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:06:54,994 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-20 00:06:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:06:56,539 INFO L93 Difference]: Finished difference Result 3442 states and 5039 transitions. [2022-07-20 00:06:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:06:56,539 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-20 00:06:56,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:06:56,551 INFO L225 Difference]: With dead ends: 3442 [2022-07-20 00:06:56,552 INFO L226 Difference]: Without dead ends: 1860 [2022-07-20 00:06:56,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:06:56,563 INFO L413 NwaCegarLoop]: 1457 mSDtfsCounter, 2869 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 1255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1255 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:06:56,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3010 Valid, 2533 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1255 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-20 00:06:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-20 00:06:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-20 00:06:56,645 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-20 00:06:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2350 transitions. [2022-07-20 00:06:56,654 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2350 transitions. Word has length 222 [2022-07-20 00:06:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:06:56,655 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2350 transitions. [2022-07-20 00:06:56,655 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-20 00:06:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2350 transitions. [2022-07-20 00:06:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2022-07-20 00:06:56,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:06:56,660 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-20 00:06:56,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 00:06:56,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:06:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:06:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1714003289, now seen corresponding path program 1 times [2022-07-20 00:06:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:06:56,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28344797] [2022-07-20 00:06:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:06:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:06:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:06:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:06:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:06:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:06:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:06:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:06:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:06:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:06:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:06:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:06:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:06:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:06:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:06:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:06:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:06:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-20 00:06:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-20 00:06:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:06:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:06:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:06:57,024 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-20 00:06:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:06:57,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28344797] [2022-07-20 00:06:57,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28344797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:06:57,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:06:57,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:06:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261029490] [2022-07-20 00:06:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:06:57,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:06:57,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:06:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:06:57,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:06:57,027 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-20 00:07:00,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:03,181 INFO L93 Difference]: Finished difference Result 3446 states and 5039 transitions. [2022-07-20 00:07:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:07:03,182 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-20 00:07:03,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:03,194 INFO L225 Difference]: With dead ends: 3446 [2022-07-20 00:07:03,194 INFO L226 Difference]: Without dead ends: 1860 [2022-07-20 00:07:03,199 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-20 00:07:03,202 INFO L413 NwaCegarLoop]: 1466 mSDtfsCounter, 1205 mSDsluCounter, 3186 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 654 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 4652 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 654 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:03,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 4652 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [654 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-20 00:07:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2022-07-20 00:07:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1628. [2022-07-20 00:07:03,273 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-20 00:07:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2348 transitions. [2022-07-20 00:07:03,281 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2348 transitions. Word has length 222 [2022-07-20 00:07:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:03,283 INFO L495 AbstractCegarLoop]: Abstraction has 1628 states and 2348 transitions. [2022-07-20 00:07:03,283 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-20 00:07:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2348 transitions. [2022-07-20 00:07:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-20 00:07:03,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:03,289 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-20 00:07:03,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 00:07:03,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1427997940, now seen corresponding path program 1 times [2022-07-20 00:07:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:03,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365357506] [2022-07-20 00:07:03,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:03,646 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-20 00:07:03,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:03,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365357506] [2022-07-20 00:07:03,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365357506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:03,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:03,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:07:03,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426964880] [2022-07-20 00:07:03,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:03,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:07:03,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:07:03,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:07:03,648 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-20 00:07:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:09,459 INFO L93 Difference]: Finished difference Result 2450 states and 3737 transitions. [2022-07-20 00:07:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 00:07:09,460 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-20 00:07:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:09,507 INFO L225 Difference]: With dead ends: 2450 [2022-07-20 00:07:09,507 INFO L226 Difference]: Without dead ends: 2448 [2022-07-20 00:07:09,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-20 00:07:09,510 INFO L413 NwaCegarLoop]: 2074 mSDtfsCounter, 1995 mSDsluCounter, 4618 mSDsCounter, 0 mSdLazyCounter, 3427 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 4301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 3427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:09,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 6692 Invalid, 4301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 3427 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-20 00:07:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2022-07-20 00:07:09,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1630. [2022-07-20 00:07:09,619 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-20 00:07:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2350 transitions. [2022-07-20 00:07:09,627 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2350 transitions. Word has length 225 [2022-07-20 00:07:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:09,628 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 2350 transitions. [2022-07-20 00:07:09,629 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-20 00:07:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2350 transitions. [2022-07-20 00:07:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-20 00:07:09,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:09,636 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-20 00:07:09,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 00:07:09,637 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:09,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1191754029, now seen corresponding path program 1 times [2022-07-20 00:07:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:09,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824051794] [2022-07-20 00:07:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:09,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:09,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:09,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 00:07:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:10,070 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-20 00:07:10,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:10,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824051794] [2022-07-20 00:07:10,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824051794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:10,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:10,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:07:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434034283] [2022-07-20 00:07:10,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:10,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:07:10,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:07:10,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:07:10,073 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-20 00:07:12,960 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:17,392 INFO L93 Difference]: Finished difference Result 4036 states and 6029 transitions. [2022-07-20 00:07:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:07:17,393 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-20 00:07:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:17,407 INFO L225 Difference]: With dead ends: 4036 [2022-07-20 00:07:17,407 INFO L226 Difference]: Without dead ends: 2452 [2022-07-20 00:07:17,413 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-20 00:07:17,414 INFO L413 NwaCegarLoop]: 1819 mSDtfsCounter, 2957 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 3450 mSolverCounterSat, 1169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3229 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1169 IncrementalHoareTripleChecker+Valid, 3450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:17,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3229 Valid, 5449 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1169 Valid, 3450 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-20 00:07:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2022-07-20 00:07:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1631. [2022-07-20 00:07:17,498 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-20 00:07:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2351 transitions. [2022-07-20 00:07:17,504 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 2351 transitions. Word has length 235 [2022-07-20 00:07:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:17,505 INFO L495 AbstractCegarLoop]: Abstraction has 1631 states and 2351 transitions. [2022-07-20 00:07:17,505 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-20 00:07:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 2351 transitions. [2022-07-20 00:07:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-20 00:07:17,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:17,512 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-20 00:07:17,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 00:07:17,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1290014060, now seen corresponding path program 1 times [2022-07-20 00:07:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:17,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038080266] [2022-07-20 00:07:17,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:07:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:17,815 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-20 00:07:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038080266] [2022-07-20 00:07:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038080266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:17,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 00:07:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040760348] [2022-07-20 00:07:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 00:07:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 00:07:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-20 00:07:17,817 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-20 00:07:20,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:25,855 INFO L93 Difference]: Finished difference Result 3383 states and 5318 transitions. [2022-07-20 00:07:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 00:07:25,855 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-20 00:07:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:25,873 INFO L225 Difference]: With dead ends: 3383 [2022-07-20 00:07:25,874 INFO L226 Difference]: Without dead ends: 3381 [2022-07-20 00:07:25,875 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-20 00:07:25,876 INFO L413 NwaCegarLoop]: 2505 mSDtfsCounter, 2807 mSDsluCounter, 8105 mSDsCounter, 0 mSdLazyCounter, 5749 mSolverCounterSat, 1215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2996 SdHoareTripleChecker+Valid, 10610 SdHoareTripleChecker+Invalid, 6964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1215 IncrementalHoareTripleChecker+Valid, 5749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:25,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2996 Valid, 10610 Invalid, 6964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1215 Valid, 5749 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-20 00:07:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2022-07-20 00:07:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 1633. [2022-07-20 00:07:25,979 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-20 00:07:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2354 transitions. [2022-07-20 00:07:25,985 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2354 transitions. Word has length 237 [2022-07-20 00:07:25,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:25,985 INFO L495 AbstractCegarLoop]: Abstraction has 1633 states and 2354 transitions. [2022-07-20 00:07:25,986 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-20 00:07:25,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2354 transitions. [2022-07-20 00:07:25,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-20 00:07:25,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:25,994 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-20 00:07:25,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 00:07:25,994 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:25,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:25,995 INFO L85 PathProgramCache]: Analyzing trace with hash -278810711, now seen corresponding path program 1 times [2022-07-20 00:07:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:25,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025320677] [2022-07-20 00:07:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:07:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-20 00:07:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 00:07:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-20 00:07:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-20 00:07:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:26,352 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-20 00:07:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:26,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025320677] [2022-07-20 00:07:26,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025320677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:26,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:26,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:07:26,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068317300] [2022-07-20 00:07:26,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:26,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:07:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:07:26,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:07:26,354 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-20 00:07:28,571 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-20 00:07:31,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:33,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:37,587 INFO L93 Difference]: Finished difference Result 4096 states and 5975 transitions. [2022-07-20 00:07:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:07:37,587 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-20 00:07:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:37,599 INFO L225 Difference]: With dead ends: 4096 [2022-07-20 00:07:37,600 INFO L226 Difference]: Without dead ends: 2509 [2022-07-20 00:07:37,606 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-20 00:07:37,607 INFO L413 NwaCegarLoop]: 2167 mSDtfsCounter, 2322 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 1045 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 4750 SdHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:37,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 4750 Invalid, 3502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 2456 Invalid, 1 Unknown, 0 Unchecked, 10.9s Time] [2022-07-20 00:07:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-07-20 00:07:37,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2173. [2022-07-20 00:07:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 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), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:07:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 3114 transitions. [2022-07-20 00:07:37,779 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 3114 transitions. Word has length 267 [2022-07-20 00:07:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:37,780 INFO L495 AbstractCegarLoop]: Abstraction has 2173 states and 3114 transitions. [2022-07-20 00:07:37,780 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-20 00:07:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 3114 transitions. [2022-07-20 00:07:37,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-20 00:07:37,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:37,795 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-20 00:07:37,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 00:07:37,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:37,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash 245344003, now seen corresponding path program 1 times [2022-07-20 00:07:37,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:37,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922583989] [2022-07-20 00:07:37,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:37,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:07:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-20 00:07:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-20 00:07:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-20 00:07:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-20 00:07:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:38,202 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-20 00:07:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:38,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922583989] [2022-07-20 00:07:38,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922583989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:38,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:38,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:07:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371432060] [2022-07-20 00:07:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:38,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:07:38,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:07:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:07:38,205 INFO L87 Difference]: Start difference. First operand 2173 states and 3114 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-20 00:07:40,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:44,408 INFO L93 Difference]: Finished difference Result 4686 states and 6967 transitions. [2022-07-20 00:07:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 00:07:44,409 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-20 00:07:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:44,421 INFO L225 Difference]: With dead ends: 4686 [2022-07-20 00:07:44,421 INFO L226 Difference]: Without dead ends: 3099 [2022-07-20 00:07:44,427 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-20 00:07:44,432 INFO L413 NwaCegarLoop]: 1995 mSDtfsCounter, 3230 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 1242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3498 SdHoareTripleChecker+Valid, 5250 SdHoareTripleChecker+Invalid, 4194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1242 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:44,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3498 Valid, 5250 Invalid, 4194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1242 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-07-20 00:07:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2022-07-20 00:07:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 2177. [2022-07-20 00:07:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1592 states have (on average 1.3863065326633166) internal successors, (2207), 1633 states have internal predecessors, (2207), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:07:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3119 transitions. [2022-07-20 00:07:44,624 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3119 transitions. Word has length 269 [2022-07-20 00:07:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:44,625 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3119 transitions. [2022-07-20 00:07:44,625 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-20 00:07:44,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3119 transitions. [2022-07-20 00:07:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-20 00:07:44,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:44,635 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-20 00:07:44,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 00:07:44,636 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1977117601, now seen corresponding path program 1 times [2022-07-20 00:07:44,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:44,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369329016] [2022-07-20 00:07:44,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:44,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:07:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 00:07:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 00:07:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-20 00:07:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-20 00:07:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:44,922 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-20 00:07:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369329016] [2022-07-20 00:07:44,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369329016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:07:44,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:07:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 00:07:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815787076] [2022-07-20 00:07:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:07:44,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 00:07:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:44,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 00:07:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 00:07:44,925 INFO L87 Difference]: Start difference. First operand 2177 states and 3119 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-20 00:07:47,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:07:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:49,297 INFO L93 Difference]: Finished difference Result 4645 states and 6777 transitions. [2022-07-20 00:07:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 00:07:49,299 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-20 00:07:49,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:49,310 INFO L225 Difference]: With dead ends: 4645 [2022-07-20 00:07:49,310 INFO L226 Difference]: Without dead ends: 2514 [2022-07-20 00:07:49,315 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-20 00:07:49,316 INFO L413 NwaCegarLoop]: 1461 mSDtfsCounter, 2056 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 3319 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1238 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:49,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 3319 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1238 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 00:07:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2022-07-20 00:07:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2177. [2022-07-20 00:07:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2177 states, 1592 states have (on average 1.3806532663316582) internal successors, (2198), 1633 states have internal predecessors, (2198), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:07:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 3110 transitions. [2022-07-20 00:07:49,467 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 3110 transitions. Word has length 272 [2022-07-20 00:07:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:49,467 INFO L495 AbstractCegarLoop]: Abstraction has 2177 states and 3110 transitions. [2022-07-20 00:07:49,468 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-20 00:07:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 3110 transitions. [2022-07-20 00:07:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2022-07-20 00:07:49,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:49,478 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-20 00:07:49,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 00:07:49,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:49,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1130512862, now seen corresponding path program 1 times [2022-07-20 00:07:49,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:49,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147946953] [2022-07-20 00:07:49,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:07:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:07:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:07:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 00:07:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 00:07:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-20 00:07:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-20 00:07:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:49,861 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-20 00:07:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:07:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147946953] [2022-07-20 00:07:49,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147946953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:07:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362442048] [2022-07-20 00:07:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:49,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:07:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:07:49,867 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-20 00:07:49,890 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-20 00:07:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:50,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 1907 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 00:07:50,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:07:50,851 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-20 00:07:50,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:07:51,146 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-20 00:07:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362442048] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 00:07:51,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 00:07:51,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2022-07-20 00:07:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749391094] [2022-07-20 00:07:51,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 00:07:51,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 00:07:51,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:07:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 00:07:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-20 00:07:51,149 INFO L87 Difference]: Start difference. First operand 2177 states and 3110 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-20 00:07:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:07:59,010 INFO L93 Difference]: Finished difference Result 6443 states and 9908 transitions. [2022-07-20 00:07:59,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 00:07:59,011 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-20 00:07:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:07:59,051 INFO L225 Difference]: With dead ends: 6443 [2022-07-20 00:07:59,051 INFO L226 Difference]: Without dead ends: 4852 [2022-07-20 00:07:59,055 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-20 00:07:59,059 INFO L413 NwaCegarLoop]: 2544 mSDtfsCounter, 6758 mSDsluCounter, 6589 mSDsCounter, 0 mSdLazyCounter, 5222 mSolverCounterSat, 2978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7152 SdHoareTripleChecker+Valid, 9133 SdHoareTripleChecker+Invalid, 8200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2978 IncrementalHoareTripleChecker+Valid, 5222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:07:59,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7152 Valid, 9133 Invalid, 8200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2978 Valid, 5222 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-20 00:07:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4852 states. [2022-07-20 00:07:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4852 to 2184. [2022-07-20 00:07:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1599 states have (on average 1.3802376485303314) internal successors, (2207), 1640 states have internal predecessors, (2207), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:07:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3119 transitions. [2022-07-20 00:07:59,258 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3119 transitions. Word has length 275 [2022-07-20 00:07:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:07:59,259 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 3119 transitions. [2022-07-20 00:07:59,259 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-20 00:07:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3119 transitions. [2022-07-20 00:07:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-07-20 00:07:59,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:07:59,275 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-20 00:07:59,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 00:07:59,499 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-20 00:07:59,500 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:07:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:07:59,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1723971340, now seen corresponding path program 1 times [2022-07-20 00:07:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:07:59,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537339420] [2022-07-20 00:07:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:07:59,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:07:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:07:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:07:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:07:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:07:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:07:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:07:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:07:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:07:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:07:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:07:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:07:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:07:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:07:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:07:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:07:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:07:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:07:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:07:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:08:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:08:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:08:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-20 00:08:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-20 00:08:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 00:08:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-20 00:08:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-07-20 00:08:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,056 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-20 00:08:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:08:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537339420] [2022-07-20 00:08:00,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537339420] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:08:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285247449] [2022-07-20 00:08:00,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:08:00,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:08:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:08:00,059 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-20 00:08:00,061 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-20 00:08:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:00,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 1969 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 00:08:00,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:08:00,798 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-20 00:08:00,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 00:08:00,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285247449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:08:00,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 00:08:00,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-20 00:08:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000871727] [2022-07-20 00:08:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:08:00,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 00:08:00,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:08:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 00:08:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-20 00:08:00,801 INFO L87 Difference]: Start difference. First operand 2184 states and 3119 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-20 00:08:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:08:01,229 INFO L93 Difference]: Finished difference Result 4712 states and 6904 transitions. [2022-07-20 00:08:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 00:08:01,229 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-20 00:08:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:08:01,242 INFO L225 Difference]: With dead ends: 4712 [2022-07-20 00:08:01,242 INFO L226 Difference]: Without dead ends: 3114 [2022-07-20 00:08:01,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-20 00:08:01,248 INFO L413 NwaCegarLoop]: 2222 mSDtfsCounter, 906 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 5910 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-20 00:08:01,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 5910 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 00:08:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2022-07-20 00:08:01,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 2186. [2022-07-20 00:08:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2186 states, 1601 states have (on average 1.3797626483447845) internal successors, (2209), 1642 states have internal predecessors, (2209), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:08:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 3121 transitions. [2022-07-20 00:08:01,442 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 3121 transitions. Word has length 284 [2022-07-20 00:08:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:08:01,443 INFO L495 AbstractCegarLoop]: Abstraction has 2186 states and 3121 transitions. [2022-07-20 00:08:01,443 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-20 00:08:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 3121 transitions. [2022-07-20 00:08:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-20 00:08:01,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:08:01,453 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-20 00:08:01,483 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-20 00:08:01,668 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-20 00:08:01,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:08:01,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:08:01,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1388851498, now seen corresponding path program 1 times [2022-07-20 00:08:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:08:01,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257164622] [2022-07-20 00:08:01,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:08:01,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:08:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:08:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:08:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:08:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:08:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:08:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:08:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:08:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:08:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:08:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:08:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:08:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:08:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:08:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:08:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:08:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:08:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:08:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:08:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-20 00:08:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-20 00:08:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-20 00:08:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-20 00:08:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-07-20 00:08:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-07-20 00:08:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 00:08:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:01,960 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-20 00:08:01,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:08:01,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257164622] [2022-07-20 00:08:01,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257164622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:08:01,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:08:01,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 00:08:01,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371716119] [2022-07-20 00:08:01,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:08:01,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 00:08:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:08:01,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 00:08:01,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-20 00:08:01,962 INFO L87 Difference]: Start difference. First operand 2186 states and 3121 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-20 00:08:03,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:06,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:08:09,687 INFO L93 Difference]: Finished difference Result 4751 states and 7044 transitions. [2022-07-20 00:08:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 00:08:09,688 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-20 00:08:09,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:08:09,699 INFO L225 Difference]: With dead ends: 4751 [2022-07-20 00:08:09,699 INFO L226 Difference]: Without dead ends: 3151 [2022-07-20 00:08:09,703 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-20 00:08:09,704 INFO L413 NwaCegarLoop]: 1980 mSDtfsCounter, 2204 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 3262 mSolverCounterSat, 1127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2337 SdHoareTripleChecker+Valid, 5834 SdHoareTripleChecker+Invalid, 4389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1127 IncrementalHoareTripleChecker+Valid, 3262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-20 00:08:09,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2337 Valid, 5834 Invalid, 4389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1127 Valid, 3262 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-20 00:08:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2022-07-20 00:08:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 2188. [2022-07-20 00:08:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 1603 states have (on average 1.379288833437305) internal successors, (2211), 1644 states have internal predecessors, (2211), 456 states have call successors, (456), 128 states have call predecessors, (456), 128 states have return successors, (456), 451 states have call predecessors, (456), 456 states have call successors, (456) [2022-07-20 00:08:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3123 transitions. [2022-07-20 00:08:09,887 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3123 transitions. Word has length 293 [2022-07-20 00:08:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:08:09,888 INFO L495 AbstractCegarLoop]: Abstraction has 2188 states and 3123 transitions. [2022-07-20 00:08:09,888 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-20 00:08:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3123 transitions. [2022-07-20 00:08:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-07-20 00:08:09,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:08:09,898 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-20 00:08:09,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 00:08:09,899 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:08:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:08:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash -279572144, now seen corresponding path program 1 times [2022-07-20 00:08:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:08:09,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705992242] [2022-07-20 00:08:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:08:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:08:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:08:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:08:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:08:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:08:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:08:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:08:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:08:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:08:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:08:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:08:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:08:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:08:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:08:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:08:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:08:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-20 00:08:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 00:08:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:08:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:08:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-20 00:08:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-20 00:08:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-20 00:08:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 00:08:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-20 00:08:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 00:08:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 00:08:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-07-20 00:08:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2022-07-20 00:08:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:10,438 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-20 00:08:10,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:08:10,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705992242] [2022-07-20 00:08:10,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705992242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:08:10,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288420702] [2022-07-20 00:08:10,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:08:10,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:08:10,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:08:10,444 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-20 00:08:10,472 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-20 00:08:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:08:11,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 2203 conjuncts, 200 conjunts are in the unsatisfiable core [2022-07-20 00:08:11,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:08:12,319 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-20 00:08:12,514 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-20 00:08:12,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 00:08:12,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,526 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-20 00:08:12,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 00:08:12,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,654 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-20 00:08:12,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,669 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-20 00:08:12,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,687 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-20 00:08:12,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,936 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-20 00:08:12,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,951 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-20 00:08:12,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:12,971 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-20 00:08:13,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,232 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-20 00:08:13,254 INFO L356 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-07-20 00:08:13,254 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-20 00:08:13,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,279 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-20 00:08:13,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,322 INFO L356 Elim1Store]: treesize reduction 66, result has 29.8 percent of original size [2022-07-20 00:08:13,322 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-20 00:08:13,328 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-20 00:08:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,371 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-20 00:08:13,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,532 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-20 00:08:13,532 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-20 00:08:13,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,539 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-20 00:08:13,543 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-20 00:08:13,552 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-20 00:08:13,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,567 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-20 00:08:13,570 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-20 00:08:13,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,857 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-20 00:08:13,892 INFO L356 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-07-20 00:08:13,893 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-20 00:08:13,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:13,926 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-20 00:08:14,366 INFO L356 Elim1Store]: treesize reduction 158, result has 20.6 percent of original size [2022-07-20 00:08:14,366 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-20 00:08:14,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:14,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:14,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:14,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:14,402 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-07-20 00:08:14,403 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-20 00:08:14,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:14,408 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-20 00:08:15,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,130 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-20 00:08:15,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,160 INFO L356 Elim1Store]: treesize reduction 55, result has 22.5 percent of original size [2022-07-20 00:08:15,161 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-20 00:08:15,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:08:15,174 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-07-20 00:08:15,175 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-20 00:08:15,180 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-20 00:08:15,185 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-20 00:08:15,254 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-20 00:08:15,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:08:15,318 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-20 00:08:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288420702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:08:15,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:08:15,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 32] total 37 [2022-07-20 00:08:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814215343] [2022-07-20 00:08:15,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:08:15,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 00:08:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:08:15,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 00:08:15,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1215, Unknown=1, NotChecked=70, Total=1406 [2022-07-20 00:08:15,334 INFO L87 Difference]: Start difference. First operand 2188 states and 3123 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-20 00:08:18,597 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-20 00:08:20,671 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:22,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:25,634 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:27,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:29,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:32,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:35,919 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-20 00:08:37,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:08:42,431 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-20 00:09:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:09:00,513 INFO L93 Difference]: Finished difference Result 5353 states and 8062 transitions. [2022-07-20 00:09:00,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 00:09:00,514 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-20 00:09:00,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:09:00,543 INFO L225 Difference]: With dead ends: 5353 [2022-07-20 00:09:00,559 INFO L226 Difference]: Without dead ends: 3731 [2022-07-20 00:09:00,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 355 SyntacticMatches, 15 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=416, Invalid=4143, Unknown=1, NotChecked=132, Total=4692 [2022-07-20 00:09:00,569 INFO L413 NwaCegarLoop]: 2402 mSDtfsCounter, 5226 mSDsluCounter, 27135 mSDsCounter, 0 mSdLazyCounter, 31002 mSolverCounterSat, 2770 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5475 SdHoareTripleChecker+Valid, 29537 SdHoareTripleChecker+Invalid, 35745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2770 IncrementalHoareTripleChecker+Valid, 31002 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1968 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2022-07-20 00:09:00,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5475 Valid, 29537 Invalid, 35745 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2770 Valid, 31002 Invalid, 5 Unknown, 1968 Unchecked, 43.5s Time] [2022-07-20 00:09:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2022-07-20 00:09:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 2206. [2022-07-20 00:09:00,995 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-20 00:09:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2206 states to 2206 states and 3155 transitions. [2022-07-20 00:09:01,008 INFO L78 Accepts]: Start accepts. Automaton has 2206 states and 3155 transitions. Word has length 301 [2022-07-20 00:09:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:09:01,009 INFO L495 AbstractCegarLoop]: Abstraction has 2206 states and 3155 transitions. [2022-07-20 00:09:01,023 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-20 00:09:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2206 states and 3155 transitions. [2022-07-20 00:09:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2022-07-20 00:09:01,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:09:01,034 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-20 00:09:01,108 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-20 00:09:01,251 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-20 00:09:01,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:09:01,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:09:01,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1080048572, now seen corresponding path program 1 times [2022-07-20 00:09:01,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:09:01,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674319860] [2022-07-20 00:09:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:09:01,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:09:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:09:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:09:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:09:01,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:09:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:09:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:09:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:09:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:09:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:09:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:09:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:09:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:09:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:09:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:09:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:09:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:09:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 00:09:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-20 00:09:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-20 00:09:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 00:09:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-20 00:09:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-20 00:09:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-20 00:09:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-20 00:09:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-20 00:09:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-20 00:09:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-20 00:09:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:01,884 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-20 00:09:01,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:09:01,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674319860] [2022-07-20 00:09:01,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674319860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 00:09:01,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 00:09:01,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 00:09:01,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961832394] [2022-07-20 00:09:01,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 00:09:01,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 00:09:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:09:01,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 00:09:01,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 00:09:01,887 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-20 00:09:04,331 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-20 00:09:06,442 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-20 00:09:08,557 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-20 00:09:10,666 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-20 00:09:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 00:09:18,788 INFO L93 Difference]: Finished difference Result 5379 states and 8104 transitions. [2022-07-20 00:09:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 00:09:18,789 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-20 00:09:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 00:09:18,803 INFO L225 Difference]: With dead ends: 5379 [2022-07-20 00:09:18,803 INFO L226 Difference]: Without dead ends: 3765 [2022-07-20 00:09:18,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-20 00:09:18,809 INFO L413 NwaCegarLoop]: 2235 mSDtfsCounter, 3900 mSDsluCounter, 7212 mSDsCounter, 0 mSdLazyCounter, 6590 mSolverCounterSat, 1922 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4067 SdHoareTripleChecker+Valid, 9447 SdHoareTripleChecker+Invalid, 8516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1922 IncrementalHoareTripleChecker+Valid, 6590 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-07-20 00:09:18,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4067 Valid, 9447 Invalid, 8516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1922 Valid, 6590 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2022-07-20 00:09:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-07-20 00:09:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 2209. [2022-07-20 00:09:19,034 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-20 00:09:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3158 transitions. [2022-07-20 00:09:19,042 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3158 transitions. Word has length 307 [2022-07-20 00:09:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 00:09:19,043 INFO L495 AbstractCegarLoop]: Abstraction has 2209 states and 3158 transitions. [2022-07-20 00:09:19,043 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-20 00:09:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3158 transitions. [2022-07-20 00:09:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2022-07-20 00:09:19,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 00:09:19,055 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-20 00:09:19,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 00:09:19,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 00:09:19,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 00:09:19,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1959306136, now seen corresponding path program 2 times [2022-07-20 00:09:19,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 00:09:19,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311018366] [2022-07-20 00:09:19,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 00:09:19,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 00:09:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:09:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-20 00:09:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-20 00:09:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-20 00:09:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-20 00:09:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-20 00:09:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-20 00:09:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 00:09:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-20 00:09:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-20 00:09:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 00:09:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-20 00:09:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-20 00:09:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 00:09:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-20 00:09:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:09:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-20 00:09:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-20 00:09:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 00:09:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 00:09:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-20 00:09:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-20 00:09:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 00:09:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-20 00:09:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-20 00:09:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-20 00:09:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-20 00:09:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-20 00:09:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-07-20 00:09:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-20 00:09:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 00:09:19,806 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-20 00:09:19,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 00:09:19,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311018366] [2022-07-20 00:09:19,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311018366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:09:19,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959698053] [2022-07-20 00:09:19,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 00:09:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 00:09:19,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 00:09:19,809 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-20 00:09:19,812 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-20 00:09:22,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 00:09:22,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 00:09:22,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 2255 conjuncts, 197 conjunts are in the unsatisfiable core [2022-07-20 00:09:22,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 00:09:22,623 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-20 00:09:22,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 00:09:22,821 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-20 00:09:22,899 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-20 00:09:22,996 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 00:09:22,996 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-20 00:09:23,068 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-20 00:09:23,135 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-20 00:09:23,208 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-20 00:09:23,263 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-20 00:09:23,263 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-20 00:09:23,569 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-07-20 00:09:23,569 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-20 00:09:23,797 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-20 00:09:23,875 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-20 00:09:23,875 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-20 00:09:23,991 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-20 00:09:24,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,238 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-20 00:09:24,241 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-20 00:09:24,249 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-20 00:09:24,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,332 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-20 00:09:24,343 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 00:09:24,344 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-20 00:09:24,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,352 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-20 00:09:24,565 INFO L356 Elim1Store]: treesize reduction 84, result has 18.4 percent of original size [2022-07-20 00:09:24,565 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-20 00:09:24,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,577 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-20 00:09:24,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,583 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-20 00:09:24,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,794 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-20 00:09:24,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,808 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-20 00:09:24,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,827 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-20 00:09:24,833 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-20 00:09:24,839 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-20 00:09:24,845 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-20 00:09:24,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:24,990 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-20 00:09:25,004 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-20 00:09:25,004 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-20 00:09:25,009 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-20 00:09:25,013 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-20 00:09:25,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,026 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-20 00:09:25,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 25 treesize of output 25 [2022-07-20 00:09:25,241 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-20 00:09:25,241 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-20 00:09:25,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,253 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-20 00:09:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,257 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-20 00:09:25,510 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-20 00:09:25,510 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-20 00:09:25,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,517 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-20 00:09:25,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,521 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-20 00:09:25,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,983 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-20 00:09:25,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,988 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-20 00:09:25,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 00:09:25,993 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-20 00:09:26,073 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-20 00:09:26,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 00:09:26,150 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-20 00:09:26,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959698053] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 00:09:26,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 00:09:26,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 42] total 49 [2022-07-20 00:09:26,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714254433] [2022-07-20 00:09:26,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 00:09:26,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 00:09:26,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 00:09:26,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 00:09:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2207, Unknown=1, NotChecked=94, Total=2450 [2022-07-20 00:09:26,167 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-20 00:09:29,747 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-20 00:09:31,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:33,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:35,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:38,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:44,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:49,090 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-20 00:09:51,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:09:53,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:10:16,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-20 00:10:17,964 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 []